The solver (based on Raymond Hettingers Puzzle Solver from Pycon 2019 Talk) shall find the shortest way from point A to point B through a labyrinth.
A labyrinth is defined as a square board of 1s and 0s, the 1s are forbidden fields.
Describe forbidden moves ....