Prolog project -- 2

Job ID: 33712907

Budget: $30 – $250 USD

Ultimate Tic-Tac-Toe.
The UTTT board (we will also call it “U-board”) consists of 9 regular TTT boards (codenamed “board”). A move of a player will be a regular move by TTT to one of the boards available for moves (about this later). In the example above, the last move was to the player 0in the position indicated by the green arrow, so the player 0moved to the position win the individual board that is in the position nin the UTTT board.
The individual TTT boards and the UTTT board are won according to the usual rules of X and 0. Winning an individual TTT board is a move (an X or 0) on the big UTTT board. In the example above, the tables in the positions nw, cand sein the U-board have already been won, by the player x, xand 0respectively. The player 0is also close to winning the tables nand ne. I have more details in the document.
Related categories: Prolog