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

您现在的位置是:虫虫源码 > 其他 > A*算法解决八数码

A*算法解决八数码

  • 资源大小:1.69 MB
  • 上传时间:2021-06-30
  • 下载次数:0次
  • 浏览次数:1次
  • 资源积分:1积分
  • 标      签: Windows开发 算法 数码 解决

资 源 简 介

题目    The 15-puzzle has been around for over 100 years; even if you don"t know it by that name, you"ve seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed into a 4 by 4 frame with one tile missing. Let"s call the missing tile "x"; the object of the puzzle is to arrange the tiles so that they are ordered as:   1  2  3  4  5  6  7  8  9 10 11 12 13 14 15  x where the only legal operation is to exchange "x" with one of the tiles with which it shares an edge. As an example, the following sequence of moves solves a slightly scrambled puzzle: 

文 件 列 表

jiugongwenti
jiugongwenti
Debug
.vs
jiugongwenti.sln
jiugongwenti.VC.db
.vs

相 关 资 源

您 可 能 感 兴 趣 的

同 类 别 推 荐

VIP VIP
0.176085s