广度优先算法八数码问题 application breadth- first search stra

Title: 广度优先算法八数码问题

Category:
Java Develop
Tags:
[Java] [源码]
File Size:
56kb
Update:
2008-10-13
Downloads:
1 Times
Uploaded by:
xiaohui_82

Description: application breadth- first search strategies : The first algorithm based on the input nodes (which are optional procedures 3X3, 4X4 ... Frankfurt several nodes), then the initial state and the end of state

Downloaders recently: [More information of uploader xiaohui_82]

To Search:

[eightdigitalissues.Rar] - AI A* algorithm to solve the problem 8nu
[adepthofeightdigitalalgorithmpriorityissue] - the algorithm depending on the input nod
[SoundMixer_Example_v1_0] - A sound mixer example in Symbian OS, see
[JiuGongTu(Digital8)DynamicSolutiondemonstrat] - (JiuGongTu) in a 3 3 JiuGongTu are 1-8 t
[12.Howtoachievemulti-threadedmulti-task?.R] - the procedures used to prepare VC, mainl
[8num] - use Java to prepare the eight digital pr
[Arithmetic_realization] - JAVA of artificial intelligence that eig
[depth_first_search] - JAVA depth-first search examples JAVA De
[NineGridProblem] - The use of Visual c++ Programming way of
[8data] - Artificial Intelligence 8 digital issues

File list (Check if you may need any files):

Main Category

SourceCode

Web Code

Develop Tools

Document

Other resource

Category

About site

CodeBus www.codebus.net