- #1
davee123
- 672
- 4
So, there's this game called "Tsuro". Pretty neat. The game contains square tiles, each with 4 line segments drawn on it, connecting points along the edges.
A little more specifically, each tile has 8 points on the edges, 2 on each side, evenly distributed on each side (IE each point is 1/3 of the distance of the whole edge from the corner).
4 line segments (curved or straight) are then drawn between these endpoints such that each endpoint is used exactly once.
How many distinct tiles are possible?
---
I figured out this answer by way of brute force, because I couldn't come up with a good logical solution, mostly thanks to the rotation factor. Can anyone think of a good way of proving the end result?
DaveE
A little more specifically, each tile has 8 points on the edges, 2 on each side, evenly distributed on each side (IE each point is 1/3 of the distance of the whole edge from the corner).
Code:
,--o--o--.
| |
o o
| |
o o
| |
`--o--o--'
4 line segments (curved or straight) are then drawn between these endpoints such that each endpoint is used exactly once.
How many distinct tiles are possible?
---
I figured out this answer by way of brute force, because I couldn't come up with a good logical solution, mostly thanks to the rotation factor. Can anyone think of a good way of proving the end result?
DaveE
Last edited: