We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
In the first case (n=2, m=2), Player 2 wins since Player 2 can mirror Player 1's moves.
In the second case (n=1, m=4), Player 1 wins by reducing the tower height optimally, forcing Player 2 to lose.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Tower Breakers
You are viewing a single comment's thread. Return to all comments →
In the first case (n=2, m=2), Player 2 wins since Player 2 can mirror Player 1's moves. In the second case (n=1, m=4), Player 1 wins by reducing the tower height optimally, forcing Player 2 to lose.