Minesweeper is the only unimplemented, unforegone exercise for 48in24 in bash. It can be implemented with an associative array to simulate a 2D array, but I’m inclined to forego it.
Opinions?
1 Like
On the one hand, it shouldn’t be overly more difficult in bash vs other languages. On the other hand, the educational value of solving it in bash probably isn’t very high. I don’t have a strong opinion and would be fine either way. No objections to foregoing this from me.
I decided to try it, and it’s an OK exercise