通过alpha-belta剪枝的极大极小值算法实现简单的五子棋+A*算法与IDA*算法解决走迷宫问题

======================================================================== MICROSOFT FOUNDATION CLASS LIBRARY : fir ======================================================================== AppWizard has created this fir application for you. This application not only demonstrates the basics of using the Microsoft Foundation classes but is also a starting point for writing your application. This file contains a summary of what you will find in each of the files that make up your fir application. fir.dsp This file (the project file) contains information at the project level and is used to build a single project or subproject. Other users can share the project (.dsp) file, but they should export the makefiles locally. fir.h This is the main header file for the application. It includes other project specific headers (including Resource.h) and declares the CFirApp application class. fir.cpp This is the main application source file that contains the application class CFirApp. fir.rc This is a listing of all of the Microsoft Windows resources that the program uses. It includes the icons, bitmaps, and cursors that are stored in the RES subdirectory. This file can be directly edited in Microsoft Visual C++. fir.clw This file contains information used by ClassWizard to edit existing classes or add new classes. ClassWizard also uses this file to store information needed to create and edit message maps and dialog data maps and to create prototype member functions. res\fir.ico This is an icon file, which is used as the application's icon. This icon is included by the main resource file fir.rc. res\fir.rc2 This file contains resources that are not edited by Microsoft Visual C++. You should place all resources not editable by the resource editor in this file. ///////////////////////////////////////////////////////////////////////////// For the main frame window: MainFrm.h,

黑白棋mfc实现采用alpha-beta剪枝算法

详细解析α-β剪枝算法过程，并且对原理进行了详细的说明。在最后用matlab代码实践了这个算法在五子棋中的应用。并且特别点名了该算法中容易犯错的地方。

基于αβ剪枝的优化的五子棋算法，用c++实现，可以三步，在优化中~

极大极小算法和剪枝法实现一字棋，含源代码和实验报告。

各种搜索算法，配合POJ上的题目，含标程，及各题解题思路。

清华大学《人工智能》5次课程大作业源码。java版。包括遗传算法 alpha-beta剪枝 模拟退火算法 九宫格 传教士与野人等问题或者算法实现源码。

阿尔法贝塔剪枝算法五子棋

利用α-β剪枝算法，按照不同搜索深度，设计多个水平级别的“一字棋”游戏。