Lecture 8# 8 Puzzle Problem using A* Algorithm | Artificial Intelligence
Автор: TecHno RayZ
Загружено: 2024-06-17
Просмотров: 11116
Описание:
The 8-puzzle problem is a classic example of a sliding puzzle. It consists of a 3x3 grid with 8 numbered tiles (1 through 8) and one blank space. The goal is to move the tiles around to achieve a specific end configuration, typically with the tiles arranged in numerical order from 1 to 8 with the blank space at the bottom-right corner.
A* is a popular search algorithm used for finding the shortest path from a starting node to a goal node. It combines features of Dijkstra’s Algorithm and Greedy Best-First Search by using a heuristic to guide the search process.
Cost Function g(n): The cost to reach the current node n from the start node.
Heuristic Function h(n): An estimate of the cost to reach the goal from node n.
Evaluation Function f(n)=g(n)+h(n). This is used to prioritize nodes during the search.
Topics Covered in this video:
Problem Description
Example
#ai #artificialintelligence #artificial #aialgorithms #puzzle #puzzlegame #youtube #engineering #engineer #computerscience
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
