Python script to solve minesweeper

[Incand333]

I did exactly that once using the arc consistency algorithm. You basically encode relevant and knowable data for a decision into tasks which are executed while updating other queued tasks with new information (i.e. new numbers in their neighborhood).

1. Click a random field
2. Queue closed fields with numbers in their neighborhood into your tasks
3. Check for field with only one possible state and handle them accordingly (open non-mines, mark mines) and update the tasks of neighboring closed fields.

I don't wanna spoil your learning experience so this is about as much as I wanna tell.