首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > Prolog实现8-puzzle

Prolog实现8-puzzle

  • 资源大小:255.02 kB
  • 上传时间:2021-06-30
  • 下载次数:0次
  • 浏览次数:0次
  • 资源积分:1积分
  • 标      签: 算法 others puzzle prolog 实现

资 源 简 介

he 8-puzzle will be represented by a 3x3 list of lists positions where the empty box will be represented by the value 9, as shown below: [[9,1,3],[5,2,6],[4,7,8]] Possibility Solution: Only half of the initial positions of the 8-puzzle are solvable. There is a formula that allows to know from the beginning if you can solve the puzzle.To determine whether an 8-puzzle is solvable, for each square containing a value N is calculated how many numbers less than N there after the current cell. For example, to the initial status

文 件 列 表

search assignment
8puzzle.pl
astarCC.pl
basics.pl
search hw.doc
waterjugs.pl
~$arch hw.doc
~$新建.doc
~WRL0005.tmp
~WRL0482.tmp
~WRL3544.tmp
VIP VIP
0.182999s