[NIM博弈变形] A在部分堆中只能取奇数另一部分只能取偶数 B任取 ZOJ3964

最新推荐文章于 2021-04-13 21:38:33 发布

ummmmm

最新推荐文章于 2021-04-13 21:38:33 发布

阅读量266

点赞数

分类专栏：博弈

本文链接：https://blog.csdn.net/ummmmm/article/details/89207678

版权

这篇博客介绍了一个名为'Yet Another Game of Stones'的博弈问题，规则是Alice和Bob轮流从石堆中取石子。Alice受约束，只能在特定条件下取石子：bi=1时只能取奇数，bi=2时只能取偶数，而Bob没有限制。如果无法再进行有效移动的玩家将输掉游戏。博客提供了输入输出格式，并包含若干样例分析，讨论了如何判断哪位玩家会赢得比赛。

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

G - Yet Another Game of Stones

ZOJ - 3964

Alice and Bob are playing yet another game of stones. The rules of this game are as follow:

The game starts with n piles of stones indexed from 1 to n. The i-th pile contains ai stones and a special constraint indicated as bi.
The players make their moves alternatively. The allowable moves for the two players are different.
An allowable move of Bob is considered as removal of some positive number of stones from a pile.
An allowable move of Alice is also considered as removal of some positive number of stones from a pile, but is limited by the constraint bi of that pile.
- If bi = 0, there are no constraints.
- If bi = 1, Alice can only remove some odd number of stones from th