Prolog 序言：使用*解决8个难题
我正在尝试实现一个问题的求解器。拼图板用列表表示。例如，目标状态：Prolog 序言：使用*解决8个难题,prolog,graph-theory,path-finding,heuristics,sliding-tile-puzzle,Prolog,Graph Theory,Path Finding,Heuristics,Sliding Tile Puzzle,我正在尝试实现一个问题的求解器。拼图板用列表表示。例如，目标状态： 1 | 2 | 3 --------- 4 | 5 | 6 --------- 7 | 8 | 0 表示为[1,2,3,4,5,6,7,8,0]，其中0表示空白 我已经实现了move（+Board，-move），它通过move成功，因为Board one的所有可能状态都从Board移开。此外，我还实现了solvable（+Board），它给出了true或false关于是否可以解决Board的问题 我还实现了两种启发式算法，ma
1 | 2 | 3
---------
4 | 5 | 6
---------
7 | 8 | 0
[1,2,3,4,5,6,7,8,0]0move（+Board，-move）moveBoardsolvable（+Board）truefalsemanhattan（+Board，+Goal，-H）hamming（+Board，+Goal，-H）BoardGoal?- hamming([1,2,3,8,0,4,7,6,5],[1,2,3,8,0,4,7,6,5],H).
H = 0.
?- hamming([1,2,3,4,0,8,7,6,5],[1,2,3,8,0,4,7,6,5],H).
H = 2.
?- manhattan([1,2,3,8,0,4,7,6,5],[1,2,3,8,0,4,7,6,5],H).
H = 0.
?- manhattan([1,2,3,4,0,8,7,6,5],[1,2,3,8,0,4,7,6,5],H).
H = 4.
?- solve([0,1,3,4,2,5,7,8,6],manhattan,Solution).
Solution = [
[0, 1, 3, 4, 2, 5, 7, 8, 6],
[1, 0, 3, 4, 2, 5, 7, 8, 6],
[1, 2, 3, 4, 0, 5, 7, 8, 6],
[1, 2, 3, 4, 5, 0, 7, 8, 6],
[1, 2, 3, 4, 5, 6, 7, 8, 0]
].
求解（+Board，+Heuristic，-Solution）解决方案Board启发式?- hamming([1,2,3,8,0,4,7,6,5],[1,2,3,8,0,4,7,6,5],H).
H = 0.
?- hamming([1,2,3,4,0,8,7,6,5],[1,2,3,8,0,4,7,6,5],H).
H = 2.
?- manhattan([1,2,3,8,0,4,7,6,5],[1,2,3,8,0,4,7,6,5],H).
H = 0.
?- manhattan([1,2,3,4,0,8,7,6,5],[1,2,3,8,0,4,7,6,5],H).
H = 4.
?- solve([0,1,3,4,2,5,7,8,6],manhattan,Solution).
Solution = [
[0, 1, 3, 4, 2, 5, 7, 8, 6],
[1, 0, 3, 4, 2, 5, 7, 8, 6],
[1, 2, 3, 4, 0, 5, 7, 8, 6],
[1, 2, 3, 4, 5, 0, 7, 8, 6],
[1, 2, 3, 4, 5, 6, 7, 8, 0]
].
For each Child of Board do:
If Child in Closed do:
Continue
If Child not in Closed or G(Board) + 1 < G(Child) do:
G(Child) := G(Board) + 1
F(Child) := G(Child) + Heuristic(Child,Goal)
If Child not in Open do:
Open := Open + {Child}
对于板的每个子级，请执行以下操作：
如果儿童处于关闭状态，请执行以下操作：
继续
如果儿童未处于关闭状态或G（板）+1G（Board）BoardBoardF（Board）BoardG（Board）BoardClosedOpenClosedOpen