Description: Using minimal algorithm to achieve a simple zero-sum game the use of recursive algorithm to achieve the game tree search method, and solve the horns chess problem.
To Search:
File list (Check if you may need any files):
Minimax_niujiaoqi
.................\Debug
.................\.....\Minimax_niujiaoqi.exe
.................\.....\Minimax_niujiaoqi.ilk
.................\.....\Minimax_niujiaoqi.pdb
.................\Minimax_niujiaoqi
.................\Minimax_niujiaoqi.sdf
.................\Minimax_niujiaoqi.sln
.................\Minimax_niujiaoqi.v12.suo
.................\.................\Debug
.................\.................\.....\minimax.obj
.................\.................\.....\Minimax_.903C7799.tlog
.................\.................\.....\......................\CL.read.1.tlog
.................\.................\.....\......................\CL.write.1.tlog
.................\.................\.....\......................\link.read.1.tlog
.................\.................\.....\......................\link.write.1.tlog
.................\.................\.....\......................\Minimax_niujiaoqi.lastbuildstate
.................\.................\.....\Minimax_niujiaoqi.log
.................\.................\.....\vc120.idb
.................\.................\.....\vc120.pdb
.................\.................\minimax.c
.................\.................\Minimax_niujiaoqi.vcxproj
.................\.................\Minimax_niujiaoqi.vcxproj.filters
.................\.................\minimax鍘熷