BFS, DFS, N-puzzle using heristic, a* and manhatta
no vote
The problem (or game) n-puzzle is probably very familiar to us as well as beginners who have access to courses in artificial intelligence. It is known for its many versions and different names such as 8-puzzle, 15-puzzle, Gem Puzzle, Boss Puzzle, Game of Fifteen, Mystic Square, ... At the simplest level I would say about 8-puzzle. II . A * search algorithm A * search algorithm is a commonly used in problems related to graph and find the way . It was chosen not only because of its effectiveness but also because it's easy to understand and install . You need to understand this algorithm before continuing . I award you've known about this theory , however for convenience of reference you can read the two links below : - A * search algorithm - A * search algorithm III . Analysis of the problem - As discussed in the previous article , there are state of