| Summary: | This thesis dives through pairing strategy as one of the methods to win as the role Breaker in Maker-Breaker tic-tac-toe. Although theorems that determine the existence of a pairing strategy configuration were mentioned by, the exact algorithm of generating such configuration has not been explored. Furthermore, as real-game tic-tac-toe affects the pairing strategy, a modified algorithm is required to obtain a new pairing configuration. With these two main problems addressed, this thesis proposes the solution to the algorithms. In addition to theoretical complexity analysis, a program is also used to reinforce the study of the game. The program is carried out with ASUS Zenbook 14" laptop using Python 3 with Jupyter Notebook documentation.
|
|---|