GitHub - egl74/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#.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
EightPuzzleConsole		EightPuzzleConsole
EightPuzzleSolver		EightPuzzleSolver
EightPuzzleSolverTests		EightPuzzleSolverTests
ModelingProject1		ModelingProject1
.gitignore		.gitignore
EightPuzzleBot.vsmdi		EightPuzzleBot.vsmdi
EightPuzzleProblem.sln		EightPuzzleProblem.sln
Local.testsettings		Local.testsettings
TraceAndTestImpact.testsettings		TraceAndTestImpact.testsettings

About

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 effe…

www.remondo.net/solving-8-puzzle-problem-a-star-algorithm-csharp/