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.
Loading...
  1. Practice
  2. Algorithms
  3. Implementation
  4. The Bomberman Game
  5. Discussions

The Bomberman Game

  • baranoob + 1 comment

    Hi anuragb26,

    I tried to understand the context of your quesiton. Here are few comments:

     

    In your image: the bomb at 1 second has 2 seconds left to explode.

     

    At 2 second:    

     

    3 3 3 3 3 3 3

    3 3 3 1 3 3 3

    3 3 3 3 1 3 3

    3 3 3 3 3 3 3

    1 1 3 3 3 3 3

    1 1 3 3 3 3 3

       

    At 3 second:

    3 3 3 0 3 3 3

    3 3 0 0 0 3 3

    3 3 3 0 0 0 3

    0 0 3 3 0 3 3

    0 0 0 3 3 3 3

    0 0 0 3 3 3 3

       

    At 4 second:

    2 2 2 3 2 2 2

    2 2 3 3 3 2 2

    2 2 2 3 3 3 2

    3 3 2 2 3 2 2

    3 3 3 2 2 2 2

    3 3 3 2 2 2 2

    Could you please try until 7 second?

    • anuragb26 + 2 comments

      Thanks a lot !!..I was actually making a mistake at the fifth second..this method of replacing the question symbols with timer cleared it up For any one else, please see the image for reference image

      • eric3141 + 1 comment

        Thanks!!
        Why couldn't the author of this challenge bother to give an example that covers all the steps? (Loops over steps 3,4.)

        • djglock + 0 comments

          I believe this is a part of the task :)

      • AGRN96 + 0 comments

        Thank you very much for placing these images of the simulation, it helped me notice a pattern in the outputs of my program.

        https://www.hackerrank.com/challenges/bomber-man/submissions/code/41610838

        The array only changes up to the 5th (n), from there it loops -> 5, 2, 3, 2 -> over and over again.