Given N piles containing White(W) and Black(B) boxes only, two players A and B play a game.
Player A may remove any number of boxes from the top of the pile having the topmost box White and Player B may remove any number of boxes from the top of the pile having the topmost box Black. If there is a pile with top as W, then player A has remove one or more boxes. Similarly if there is a pile with top as B, then player B has to remove one or more boxes. They play alternating, with the player A first to move. Both players plays optimally.
The task is to find the winner of the game (who cannot make the last move). Player last to move loses the game.
Input: N = 2
Player A can remove all boxes from pile 1. Now player B has to make a choice from pile 2. Whatever choice player B makes, he/she has to make the last move.
Input: N = 3
WWWW, WBWB, WBBW
Approach: The game theory problems, where the player who makes the last move lose the game, are called Misere Nim’s Game.
- If there are consecutive occurrences of the same box in any pile, we can simply replace them with one copy of the same box, since it is optimal to remove all occurrences of the box present at the top. So, we can compress all piles to get the pile of form BWBWBW or WBWBWB.
- Now, suppose there’s a pile, which have topmost box differing from its bottom-most box, we can prove that answer remains same even without this pile, because if one player makes a move on this pile, other player makes the next move by removing box from the same pile, resulting in exactly same position for the first player.
- If a pile has both top and bottom-most box as same, It requires one or the player to make one extra move. So, just count the number of extra move each player has to make. The player which runs of out extra moves first wins the game.
Below is the implementation of the above approach.
Time Complexity: O(N)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Find the winner of a game of removing any number of stones from the least indexed non-empty pile from given N piles
- Game Theory (Normal-form game) | Set 3 (Game with Mixed Strategy)
- Game Theory (Normal-form Game) | Set 6 (Graphical Method [2 X N] Game)
- Game Theory (Normal-form Game) | Set 7 (Graphical Method [M X 2] Game)
- Find the winner in nim-game
- Find the winner of the Game to Win by erasing any two consecutive similar alphabets
- Find the winner of the Game
- Predict the winner of the game | Sprague-Grundy
- Predict the winner in Coin Game
- Predict the winner of the game on the basis of absolute difference of sum by selecting numbers
- Winner in the Rock-Paper-Scissor game using Bit manipulation
- Determine winner of the Game by arranging balls in a row
- Determine the winner of a game of deleting Characters from a String
- Combinatorial Game Theory | Set 2 (Game of Nim)
- Game Theory (Normal - form game) | Set 1 (Introduction)
- Game Theory (Normal-form Game) | Set 4 (Dominance Property-Pure Strategy)
- Game Theory (Normal-form Game) | Set 5 (Dominance Property-Mixed Strategy)
- Find the winner by adding Pairwise difference of elements in the array until Possible
- Find the player who will win the Coin game
- Find the player who wins the game by removing the last of given N cards
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.