Timeline for Issue with implemented Minesweeper algorithm
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 13, 2011 at 16:32 | comment | added | Stephen | Or put all visited squares in a closed list and only call the function for squares which are not in the closed list. | |
| Aug 12, 2011 at 23:58 | comment | added | doppelgreener | @espais For something as light as minesweeper that will probably do the job just fine. | |
| Aug 12, 2011 at 18:24 | comment | added | erik | i just added a boolean flag to my Mine class...then reset that flag once all the recursive calls are complete | |
| S Aug 12, 2011 at 15:48 | history | suggested | Richard Marskell - Drackir | CC BY-SA 3.0 |
Replaced bullets with code formatting since they were kind-of distracting
|
| Aug 12, 2011 at 15:47 | review | Suggested edits | |||
| S Aug 12, 2011 at 15:48 | |||||
| Aug 12, 2011 at 15:38 | comment | added | Nakilon | As TokPhobia said, you should somehow save and get info about what cells are already processed. Another way to save this info is dictionary. Python has them. It would be of the same perfomance, as to have "another matrix". | |
| Aug 12, 2011 at 13:53 | history | edited | TokPhobia | CC BY-SA 3.0 |
minor grammar fix to make things clearer
|
| Aug 12, 2011 at 13:40 | vote | accept | erik | ||
| Aug 12, 2011 at 13:30 | comment | added | erik | ohhhhhhhhh crap...that makes a lot more sense now. thanks! | |
| Aug 12, 2011 at 13:13 | history | answered | TokPhobia | CC BY-SA 3.0 |