jcworkspace / EightPuzzleProblem

The 8-Puzzle Problem is a thing they throw at you when you study Artificial Intelligence. It’s a great little problem for learning to understand search trees and shortest path algorithms with heuristics. Traveling via Breadth-First Search, via Depth First Search we mostly end up with the A* Algorithm using a Manhattan Distance Heuristic for effectively solving this problem. This article shows a way how to do this in C#.