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.
- Tower Breakers
- Discussions
Tower Breakers
Tower Breakers
Sort by
recency
|
414 Discussions
|
Please Login in order to post a comment
python
def towerBreakers(n, m): if m == 1 or n % 2 == 0: return 2 return 1
But Player 1 has 3 possible moves: reduce height to 1 (6 modulo 1 = 0), reduce height to 2 (6 modulo 2 = 0), and reduce height to 3 (6 modulo 3 = 0). This challenge doesn't make sense
I dont understand a thing about this question. is it just me ?
Scala Solution
Poorly written problem and explanation.