{"repository":{"description":"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#.","homepage":"http://www.remondo.net/solving-8-puzzle-problem-a-star-algorithm-csharp/","watchers":1,"stargazers":1,"forks":5,"fork":false,"size":108,"owner":"remondo","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C#","created_at":"2012-07-01T06:02:21-07:00","pushed_at":"2012-07-08T00:42:38-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/Ropsat/EightPuzzleProblem"}