poj3537（博弈SG函数）

最新推荐文章于 2021-02-17 16:04:41 发布

ten_three

最新推荐文章于 2021-02-17 16:04:41 发布

阅读量952

点赞数

分类专栏：博弈文章标签： poj

本文链接：https://blog.csdn.net/ten_three/article/details/10309725

版权

这篇博客探讨了在1 × n格子上进行的Crosses and Crosses游戏，玩家轮流放置十字标记，目标是形成三连串。如果双方都采取最优策略，分析表明当n为奇数时，先手者（玩家1）获胜，否则后手者（玩家2）获胜。通过递归和Nim游戏理论可以解决这个问题。输入为n的值，输出为赢家编号，1表示先手赢，2表示后手赢。

摘要由CSDN通过智能技术生成

地址： http://poj.org/problem?id=3537

Crosses and Crosses

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 2166		Accepted: 800
Case Time Limit: 2000MS

Description

The game of Crosses and Crosses is played on the field of 1 × n cells. Two players make moves in turn. Each move the player selects any free cell on the field and puts a cross ‘×’ to it. If after the player’s move there are three crosses in a row, he wins.

You are