You should turn in 2 files: (1) a file (YourUWNetID)TTT.py with your Tic-Tac-Toe playing agent described in Part I, and (2) a file (YourUWNetID)KinARowMoveGenerator.py that provides your solution to Part II.
 

Within this file, you should define a function tttAllMoves(state) that accepts a state, represented in the format described below, and returns a list of [move, newState] pairs, each of which represents one legal move from the given state and the state that results from making that move. The given state's data structure should not be changed by your code. The list returned by your function should contain the result of all legal moves, only legal moves, and it should not contain any duplicate states. The order in which the new states occur on the list does not matter.

Three other functions should also be defined in your file. A function called introduce() should return a string that "introduces" the player, giving its full name (you get to make that up), the name and UWNetID of its creator (you), and any words to describe its character.

A function called nickname() should return a short version of the playing agent's name (16 characters or fewer). This name will be used to identify the player's moves in game transcripts.

The most important function is makeMove(currentState, currentRemark, timeLimit=10000). This should return a triple of the form [move, newState, newRemark, stats]. The move is a triple describing the chosen move, and its format is described later. The newState is the result of making the move from the given currentState. The currentRemark argument is a string representing a remark from the opponent on its last move. The timeLimit can be ignored in this assignment, but it will become important in Assignment 4; it will represent the number of milliseconds available for computing and returning the move. The newRemark to be returned must be a string. For this assignment, it can simply be a constant statement, such as "Tommy the Tic-Tac-Toe Terror has made his move!" However, it should be consistent with the name and character of your agent as described by your introduce() function. The fourth component of the returned list is the stats item. For this assignment, the stats item should be a string that reports the number of states examined in the course of determining the move.

Representations of moves and states:
We will use the following shorthand notation for representing a move: (isXtoMove, row, column). Example: (True, 2, 1) means that the player puts an X in row 2, column 1. (Middle of the bottom row of the Tic-Tac-Toe board).
A state is represented in the form of a pair [board, isXtoMove]. A board is represented as a list of lists. The initial state is:

[[[0, 0, 0],
  [0, 0, 0],
  [0, 0, 0]], True]

Testing:
You should test your player in a game situation by downloading both a gameMaster program and an opponent agent. These are available here.

Create a function kInARowAllMoves(state) that returns a list of [move, state] pairs for this more general version of the K-in-a-Row game. Your function may assume that a global variable K has, as its value, the integer that tells how many Xs or Os a player must have in a line to win.
The following is an example board in a KinARow game called "5 in a Row on 7-by-7 board with Corners Forbidden" is shown below.

[[3, 0, 0, 0, 0, 0, 3],
 [1, 1, 0, 0, 0, 0, 0], 
 [0, 0, 0, 0, 0, 0, 0], 
 [0, 0, 0, 0, 0, 0, 0], 
 [0, 0, 0, 0, 0, 2, 0], 
 [0, 0, 0, 0, 0, 0, 0], 
 [3, 0, 0, 0, 0, 0, 3]]