diff options
| author | KaiStevenson <kai@kaistevenson.com> | 2022-11-22 16:29:13 -0800 |
|---|---|---|
| committer | KaiStevenson <kai@kaistevenson.com> | 2022-11-22 16:29:13 -0800 |
| commit | 5c80ba6ca83990b50683273fb96fc520112be887 (patch) | |
| tree | df3abd4f74df863ea4bdc6e342e35e6aaed11c51 /README | |
| parent | 3b472236a16565e1f9d2deec4d4ea793db88f972 (diff) | |
Diffstat (limited to 'README')
| -rw-r--r-- | README | 8 |
1 files changed, 8 insertions, 0 deletions
@@ -0,0 +1,8 @@ +Compile ttt.c in whatever manner you like, and run it. Enter coordinates in the form a2, or 1c to select your move. +The minimax AI will perform a tree search to determine its move. The AI will never lose, and may win if you make a mistake. +The AI is limited in the sense that it assumes you will play perfectly. It will not attempt to trick you into playing a poor move. + +If you wish to modify the code, it should be fairly self-explanatory. There is an array named get_move_ptrs which is defined in main(). This array gives pointers to functions that get input. +When an X is to be placed, the function pointed to by get_move_ptrs[0] is called. When a Y is to be placed, get_move_ptrs[1]. +To have two human players play against each other, replace each pointer with user_input_pos. For two minimax bots, ai_input_pos. +To implement a new AI model or new player interface, simply define a function accepting a 2d array (the current board state) and an int (the player whose turn it is). This function must return an int*, with the X coordinate of the move in [0] and the Y coordinate in [1]. |
