Anonymous user
Talk:Minesweeper game: Difference between revisions
→Differences in behavior from classic game
(→Differences in behavior from classic game: Probably, I didn't analyse it in depth, sorry!) |
|||
Line 8:
: I must say that I just made up what I thought was the clearing algorithm on games I had played some time ago, and I was probably unconsciously trying to minimise complexity in an already large task. Could we go with this simpler clearing strategy, at risk of impairing the playability of the game? --[[User:Paddy3118|Paddy3118]] 11:01, 11 July 2010 (UTC)
:: The classic clearing criterion is to only auto-reveal cells if they have no mines in the neighbors at all. It's pretty trivial to do this given that you need to calculate that figure anyway for display on the cell, and you can just call the clearing function (safely) recursively. (It gets slightly tricker with a very large grid since it's possible to get into problems with recursion depth, if that's something your language implementation imposes a cap on, but that's a refinement really.) –[[User:Dkf|Donal Fellows]] 11:37, 11 July 2010 (UTC)
| |||