- #1

- 532

- 31

## Main Question or Discussion Point

There is a board game called "Quoridor" (http://en.wikipedia.org/wiki/Quoridor) where you build walls in such a way that your enemy is impeded and you are helped. I would like to build some similar pieces out of wood large enough to allow my students' robots to have a "changeable" maze they could test out pathfinding and such with.

The wall pieces can only touch 2 squares (not 3). For my purposes, there can be any number of walls allowed. (in the game, each player gets 10 walls and can either move or place a wall each turn)

My math question is how many possible paths are there:

a: That lead from one side to the other with the original 81 square board.

b: On an easier to physically construct 3x6 board.

c: How to find max paths for an m x n board

The wall pieces can only touch 2 squares (not 3). For my purposes, there can be any number of walls allowed. (in the game, each player gets 10 walls and can either move or place a wall each turn)

My math question is how many possible paths are there:

a: That lead from one side to the other with the original 81 square board.

b: On an easier to physically construct 3x6 board.

c: How to find max paths for an m x n board