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
|
32 Discussions
|
Please Login in order to post a comment
Python. Runs the clock and does explosions until a cycle is found. For explosion steps, grid for each t % 2 == 1 is kept in the memory. Once the cycle is found, number of steps to make through the graph is calculated, as well as the cycle length and with that final_t can be calculated.
Java
JS
C# Solution:
JS When we detonate array again and again we will see there a pattern of same repeating arrays for example