Hi If you are avaialble to do racket, lisp, scheme , prolog task please message
You will implement certain components of an Ultimate Tic-Tac-Toe game in Prolog . We will call the Ultimate Tic Tac Toe game “UTTT” and a regular Tic-Tac-Toe game (X and 0) “TTT”. We will identify the individual tables, as well as the positions in the individual tables, by the “positions” (in the order of scrolling from left to right and from top to bottom): NW, N, NE, W, C, E, SW, S, SE. The UTTT board (we will also call it “U-board”) consists of 9 regular TTT boards (codenamed “board”). A move by 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 positio...
