Description: Solve the 8-puzzle problem using A* algorithme.
Input: Program reads start state and goal state and heuristic (N or S) from EightPuzzle.INP file.0 representing blank.
There are 2 Heuristic:
1. N: Number of misplaced tiles
2. S: Sum of Manhattan distance of current location and target location.
Format: The first line write type of heuristic (N or S).
Next is the status of departing and landing status. Between 2 states of 1 line blank.
See examples EightPuzzle.INP
- [8puzzlesolve] - This an 8-puzzle solver. You input the c
- [puzzle] - Solving the maze. Data Structure Section
- [8puzzle_Astar] - An A-star algorithm for solving 8-puzzle
- [puzzlesolver] - A 8 puzzle program solver.user have to i
- [8puzzle(C)] - A digital satellite algorithm to solve e
- [8] - using A* algorithm to solve Eight-puzzle
- [8puzzle] - 8 digital games, the use of heuristic co
- [Chess(8puzzle)] - 8-puzzle A* BFS DFS MFC
- [n-puzzle] - n-puzzle (8-puzzle, 15-puzzle, 24-puzzle
- [EIGHTPUZZLE] - With the A* algorithm to solve 8 puzzle
File list (Check if you may need any files):
EightPuzzle.cpp
EightPuzzle.INP
Download