---
# System prepended metadata

title: Mazerunner Tactics

---

# Mazerunner Tactics

Imagine a mxn grid maize. There are four types of cells in the maize:

**S: starting position
G: end position
O: obstacle
F: free navigable space**

A computer agent is initially positioned at S and can move in four directions:
up, down, left, and right.
Your task is to **write the pseudocode/logic of the agent so that it can 
navigate the maize and reach the end position**.
Present your approach including
it’s strengths and limitations. The approach will be judged based on its 
**completeness, robustness, computational complexity, generalizability**, and
ability to handle edge cases.

| S     | F     | F     | ~~O~~ | F     | F     |
| ----- | ----- | ----- | ----- | ----- | ----- |
| ~~O~~ | ~~O~~ | **F** | ~~O~~ | ~~O~~ | F     |
| F     | F     | **F** | F     | F     | F     |
| F     | F     | **F** | F     | ~~O~~ | F     |
| ~~O~~ | F     | **F** | **F** | **F** | **F** |
| F     | ~~O~~ | ~~O~~ | ~~O~~ | ~~O~~ | **F** |
| F     | ~~O~~ | F     | F     | **G** | **F** |

## Notes

* https://qiao.github.io/PathFinding.js/visual/
* Verhältnis zwischen freien Feldern und Obstacles entscheidet über Algorithmus
* Djikstra
  * Muss jeden möglichen Weg kennen, um eine Entscheidung zu treffen 
* Best First Seach
  * Problematisch, da es sich nicht vom Endpunkt entfernt 
* A*

## Example

```python

    
```
