learn-co-students / mine-sweeper-web-0217

Mine Sweeper

Background

Arel accidently placed mines around the campus. What can we say? Mistakes were made. Luckily he mapped out the spots where he placed them in a two dimensional array.

Arel's Map

[
  [0,  0,   0,  0, '*'],
  [0,  0,  '*', 0,  0 ],
  [0,  0,   0,  0,  0 ],
  [0, '*', '*', 0,  0 ],
  [0,  0,   0,  0, '*']
]

Instructions

Before we can begin defusing the mines we need to figure out the most dangerous spots. What we need you to do is to come up with a way to increment every tile that is one move away from each mine. So there at most 8 tiles affected by each mine.

This is going to mean moving through each row on the map until you find a mine and then incrementing all the surrounding tiles by one. Keep in mind (or should we say "mine"???) (I'm sorry for that) that this is going to need to happen one row at a time, and a row isn't finished until every affected tile is incremented.

Resources

• Odin Project - Recusion
• Joshua Creek's Ruby Kickstart - Introduction to Recusion

View Mine Sweeper on Learn.co and start learning to code for free.