文件名称:595649320051004
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:14.03kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
八数码问题也称为九宫问题。在3×3的棋盘,摆有八个棋子,每个棋子上标有1至8的某一数字,不同棋子上标的数字不相同。棋盘上还有一个空格,与空格相邻的棋子可以移到空格中。要求解决的问题是:给出一个初始状态和一个目标状态,找出一种从初始转变成目标状态的移动棋子步数最少的移动步骤。
-8 issue of the digital problem, also known as Nine-palace. In the 3 × 3 chessboard placed eight pieces, each piece is marked 1 to 8, a number of different pieces on the subject are not the same. There is also a board space, and spaces adjacent pieces can be moved to the space. To be resolved is: given an initial state and a target state, to find a target state from the initial movement into the least number of pieces of mobile steps step.
-8 issue of the digital problem, also known as Nine-palace. In the 3 × 3 chessboard placed eight pieces, each piece is marked 1 to 8, a number of different pieces on the subject are not the same. There is also a board space, and spaces adjacent pieces can be moved to the space. To be resolved is: given an initial state and a target state, to find a target state from the initial movement into the least number of pieces of mobile steps step.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
20051004深度优先/8_num/8_num.cpp
20051004深度优先/8_num/8_num.ncb
20051004深度优先/8_num/8_num.plg
20051004深度优先/8_num/ReadMe.txt
20051004深度优先/8_num/StdAfx.cpp
20051004深度优先/8_num/StdAfx.h
20051004深度优先/8_num/8_num.opt
20051004深度优先/8_num/8_num.dsp
20051004深度优先/8_num/8_num.dsw
20051004深度优先/8_num/Debug
20051004深度优先/8_num
20051004深度优先
20051004深度优先/8_num/8_num.ncb
20051004深度优先/8_num/8_num.plg
20051004深度优先/8_num/ReadMe.txt
20051004深度优先/8_num/StdAfx.cpp
20051004深度优先/8_num/StdAfx.h
20051004深度优先/8_num/8_num.opt
20051004深度优先/8_num/8_num.dsp
20051004深度优先/8_num/8_num.dsw
20051004深度优先/8_num/Debug
20051004深度优先/8_num
20051004深度优先
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.