Playing the game of Go 囲碁 on a random Penrose tiling can guarantee that neither player has seen a particular board before playing on it. The dual of a Penrose tiling has each node connected to four neighbors as in regular Go.
What kind of data structure would be good for storing and manipulating Penrose tiles?
No comments :
Post a Comment