搜索资源列表
AIbashumaJava1
- 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital,
EightNumTal
- 此为八数码问题（即九宫问题）的程序。初始状态不定，目标状态确定-this for eight digital (ie JiuGongTu) procedures. Adventitious initial state, the state set target
2005217185414373
- 八数码问题的几种不同解法 八数码问题的几种不同解法-eight digital issues several different solutions to the problem of digital eight several different solution
ChessEight
- 解决八数码问题的经典程序。实现了宽带优先算法，深度优先算法，A* 算法。图形化显示结果。-solve the classic problem of the digital process. Broadband achieved priority algorithm, depth-first algorithm, A* algorithm. Graphic shows results.
my8num.RAR
- 八数码问题的深度优先算法，优秀的显示效果。-eight digital depth of the priority algorithm, showed excellent results.
aEightNum
- 八数码，人工智能课程设计，实现八数码的两个搜索算法-eight digital, artificial intelligence curriculum design, realization of the two eight digital search algorithm
AI-eightnumber
- 实现八数码自动有初始状态到达目标状态,并显示输出各步走向.-achieve eight digital automatic initial state at the target state, and that each step toward output.
AI-widefirst
- 八数码宽度优先搜索算法,可以找到最优解,但会消耗更多的资源.-eight digital width first search algorithm to find the optimal solution, but it will consume more resources.
JiuGongTree
- 这是有一个解决八数码问题的程序！ 主要应用了宽度优先搜索法！ 是用C#开发的-This is a solution to the problem of digital eight procedures. Application of the width of the main priorities Search! Is the development of the C#
eightnumberwww
- 人工智能中的八数码难题,人工智能中的八数码难题-artificial intelligence of eight puzzle, artificial intelligence of eight puzzle
eightnumber(2007_4_26)
- 八数码难题解法 new 在一个３×３的九宫中有１－８这８个数及一个空格随机的摆放在其中的格子里。现在要求实现这个问题：将该九宫格调整为指定的形式。调整的规则是：每次只能将与空格（上、下、或左、右）相邻的一个数字平移到空格中。-Eight new digital problem solution in a 3 × 3 of the Nine-palace are 1-8 this 8 random number and the pla
21codes_25819487
- 主要实现八数码问题的功能。。。。。 能实现滑块问题求解系统-eight main issues of the digital functions. . . . . Achieve slider problem solving system.
57130.45916033
- 人工智能八数码源代码 启发式搜索解决八数码问题的源代码 8数码难题算法,界面比较漂亮。操作简单-eight digital artificial intelligence heuristic search the source code to solve the problem eight digital source code 8 puzzle algorithm, interface more beautiful. Simple o
EigthGrid_cws
- 用JAVA做的一个简单的八数码问题的游戏,用户可以移动数字,当移动到正确位置时,系统提示成功.-with JAVA do a simple eight of the digital games, mobile users can figure, When moved to the correct position, the system prompt success.
EightFigure(A-Star)
- 经典的八数码问题,重在相互交流(A*算法实现).-eight digital classic problem lies in mutual exchanges (A* algorithm).
Eight_Num_Fengart
- 本代码是为了应付人工智能的实验而编写的，写的潦草请不要介意。我又是通过这代码来“引玉”，相信看过我编写的黑白棋源代码的人应该知道“引玉”是什么意思。如果你有“玉”（什么更高效的算法能在更短的时间内求得结果，或者博弈方面的），就欢迎“砸”过来－－fengart@126.com，我会很感激！（A* 算法解决八数码问题我已经研究过了，不要砸这个来）在 赛扬D2.1G 的机器上测试，算法的解答时间不超过0.1秒。 最好优先搜索算法的解答时间一般
JIUGONGTUXINJIE
- 一个人工智能的八数码难题,也叫九宫图难题,算法仅供参考.-an eight digital artificial intelligence problems, it has also called JiuGongTu problem, the algorithm is for reference only.
eightnumbers
- 选择深度优先算法来求解该八数码问题（3×3九宫格棋盘）-Choice of depth-first algorithm to solve the problem of the eight digital (3 × 3 squares chessboard)
eightnumber
- 八数码问题的C++实现，最经典的广度有限算法-eight digital realization of the C and classic algorithms limited breadth
MazeBot
- 很好的解决八数码问题，快速，有效，很好的哦大家可以试试哦