博弈搜索练习-极大极小值搜索+AlphaBeta剪枝--POJ 1085-Triangle War/三角点格棋

本文链接：https://blog.csdn.net/qq_38597315/article/details/75007297

该博客介绍了如何利用极大极小值搜索配合AlphaBeta剪枝解决POJ 1085-Triangle War游戏的问题。在给定的棋盘局面下，通过分析判断先行者是否能确保胜利。博主分享了代码和讨论中的关键技巧，强调了位运算在解题中的重要性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Triangle War

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3066		Accepted: 1207

Description

Triangle War is a two-player game played on the following triangular grid:

三角点格棋是一个在如图所示的棋盘上进行的双人游戏：

Two players, A and B, take turns filling in any dotted line connecting two dots, with A starting first. Once a line is filled, it cannot be filled again. If the line filled by a player completes one or more triangles, she owns the completed triangles and she is awarded another turn (i.e. the opponent skips a turn). The game ends after all dotted lines are filled in, and the player with the most triangles wins the game. The difference in the number of triangles owned by the two players is not important.

A ， B 两名玩家轮流连接一次图中带有数字的点之间的虚线（ A 先手），每条虚线只能被连接一次，每当一名玩家将一个或多个三角形（指边长为一单位的最小三角形）的所有虚线全部连接时，他连成的三角形个数将计入他的总分，并且，他将被奖励一个回合（换言之对手跳过一次行动）。当所有的 18 条虚线均被连接时游戏结束，得分高者获胜。