*算法属于一种启发式搜索,它扩展结点的次序类似于广度优先搜索,但不同的是每生成一个子结点需要计算估价函数F,以估算起始结点的约束经过该结点至达目标结点的最佳路径代价;每当扩展结点时,意是在所有待扩展结点中选择具有最小F值的结点做为扩展对象,

Packet : 8numbers.rar filelist
人工智能
人工智能\AI3.APS
人工智能\AI3.clw
人工智能\AI3.cpp
人工智能\AI3.dsp
人工智能\AI3.dsw
人工智能\AI3.h
人工智能\AI3.ncb
人工智能\AI3.opt
人工智能\AI3.plg
人工智能\AI3.rc
人工智能\AI3Doc.cpp
人工智能\AI3Doc.h
人工智能\AI3View.cpp
人工智能\AI3View.h
人工智能\Debug
人工智能\Debug\AI.exe
人工智能\Display.cpp
人工智能\Display.h
人工智能\InitDialog.cpp
人工智能\InitDialog.h
人工智能\InputAdvDlg.cpp
人工智能\InputAdvDlg.h
人工智能\Main.cpp
人工智能\Main.h
人工智能\MainFrm.cpp
人工智能\MainFrm.h
人工智能\PreDefine.h
人工智能\res
人工智能\res\AI3.ico
人工智能\res\AI3.rc2
人工智能\res\AI3Doc.ico
人工智能\res\mainfram.bmp
人工智能\res\Thumbs.db
人工智能\res\Toolbar.bmp
人工智能\resource.h
人工智能\StdAfx.cpp
人工智能\StdAfx.h
人工智能\人工智能.doc
人工智能\关于本程序.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．