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
標(biāo)簽：
state
algorithme
Program
problem
上傳時(shí)間：
2017-08-12
上傳用戶：jjj0202
