This workshop assumes that you have recently completed Workshop: Nim.
Like Workshop: Nim, this workshop develops an implementation of the combinatorial game, Tic-tac-toe. This workshop demonstrates the use of arrays and more advanced Reach data-structures. We’ll discuss two variations of this same application: one where the consensus network verifies the moves of each player; and, another where the consensus network allows illegal moves to be disputed by the other player. These variations demonstrate two DApp patterns that occur commonly in existing DApp designs, each with different usage constraints and performance trade-offs.
This page is a placeholder for a future more detailed workshop. You could try to implement yourself though, given the sketch above! If you’d like to see a draft version of our code, please visit examples/ttt in our GitHub repository