Solving 8 puzzle problem using A* search in Unity
Welcome to our Unity game development tutorial series. In this tutorial, we will build the 8-puzzle game and integrate A* pathfinding to solve it. This tutorial is divided into three sections. In section 1, we will focus on implementing the 8-puzzle game functionality, emphasising the programming aspects over design elements. In section 2, we will delve into implementing our pathfinding algorithms, including A-Star, Dijkstra's, and Greedy Best-First Search. Finally, in section 3, we will apply these pathfinding algorithms to solve various configurations of the 8-puzzle. You can find the entire source code for this tutorial at https://github.com/shamim-akhtar/gamd...
Download the images: https://github.com/shamim-akhtar/gamd...
Read the complete tutorial on https://faramira.com/8-puzzle-problem...
Timestamps:
0:44 - Introduction
2:45 - Heuristic Search
3:54 - The Unity Project
5:43 - The Puzzle Board
7:57 - The Puzzle Board Script
15:50 - The Puzzle State
21:04 - The Neighbouring Tiles
31:15 - Randomizing Tiles
33:17 - The Basic UI
39:10 - 8-Puzzle Game Play
39:52 - Pathfinder and A* Implementation
1:02:02 - Integrating the Pathfinder
1:03:42 - Manhattan Cost Function
1:12:30 - A* Solving 8-Puzzle in Action