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

[{"title":"（ 10 个子文件 8KB ） 通过alpha-belta剪枝的极大极小值算法实现简单的五子棋+A*算法与IDA*算法解决走迷宫问题","children":[{"title":"ai_1.2.cpp <span style='color:#111;'> 5.57KB </span>","children":null,"spread":false},{"title":"input2.txt <span style='color:#111;'> 3.56KB </span>","children":null,"spread":false},{"title":"output_ida_2.txt <span style='color:#111;'> 133B </span>","children":null,"spread":false},{"title":"ai_2.cpp <span style='color:#111;'> 11.96KB </span>","children":null,"spread":false},{"title":"ai_1.1.cpp <span style='color:#111;'> 4.56KB </span>","children":null,"spread":false},{"title":"output.txt <span style='color:#111;'> 122B </span>","children":null,"spread":false},{"title":"output_astar_1.txt <span style='color:#111;'> 55B </span>","children":null,"spread":false},{"title":"input1.txt <span style='color:#111;'> 916B </span>","children":null,"spread":false},{"title":"output_astar_2.txt <span style='color:#111;'> 133B </span>","children":null,"spread":false},{"title":"output_ida_1.txt <span style='color:#111;'> 56B </span>","children":null,"spread":false}],"spread":true}]