# BASIC DARK PRESENTATION

Isabela Rezende

Created on April 18, 2022

## More creations to inspire you

### ASTL

Presentation

### ENGLISH IRREGULAR VERBS

Presentation

### VISUAL COMMUNICATION AND STORYTELLING

Presentation

### GROWTH MINDSET

Presentation

### BLENDED LEARNING

Presentation

### INTRO INNOVATE

Presentation

### SUMMER ZINE 2018

Presentation

## Transcript

Solving Minesweeper with Artificial Intelligence

da Silva, Isabela - 2022

How to play Minesweeper

1

- The Begginer's grid is 10x10;
- You should click on the middle and than analyze the numbers to identify where the mines are;
- When you are sure of their positions, you mark the places with a flag;
- Finally, you click on the places you know that are not mines and keep repeting the process.

Straightforward Algorithm

How the AI is going to play

2

- The idea for the Tank algorithm is to enumerate all possible configurations of mines for a position, and see what’s in common between these configurations.

The Tank Solver Algorithm

- To implement the Tank algorithm, we make a list of border tiles: all the tiles we aren’t sure about but have some partial information.
- If we made the AI look at all the board, it would probably solve this after some time, but that wouldn't be efficient.

The Tank Solver Algorithm

The probability problem

3

- One of the two squares has a mine. It could be in either, with equal probability, so it's a 50-50 chance.
- The Tank Solver fails it and the only choice left is to calculate the best guess possible by probability.

How the AI itself will be done

4

- Read the board.

- Calculate the data

- Click the board

Bibliography

<https://dev.to/krlove/creating-advanced-minesweeper-solver-using-logic-programming-2ppd> Accessed on 13/04/2022

<https://luckytoilet.wordpress.com/2012/12/23/2125/> Accessed on 13/04/2022

<https://github.com/arcs-/Minesweeper-Solver> Acessed on 13/04/2022