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.
- The Bomberman Game
- Discussions
The Bomberman Game
The Bomberman Game
Sort by
recency
|
75 Discussions
|
Please Login in order to post a comment
Python 3
This took a long time for me to solve, and the reason was I just didn't consider the property of a pattern that it always repeat. The solution is there could be only 4 right answers 1. Bombs in all rooms 2. Bombs in room as an input 3. Bombs in room after 1st blast 4. Bombs in room after 2nd blast
Here is my solution in golang
My C# solution :)
I knew that it would always cycle between 2 states, every odd second. But was proven wrong that it doesn't cycle back to the initial state. So you just need to calculate the state at 3,7,11 and so on, and the state at 5,9,13 and so on. And then use (after determining it's not an even second or the 1st second) a state dependent on (n+1)%4==0