to get started.
1. Game (tic-tac-toe) playing.
a. Implement terminal check and utility functions for tic-tac-toe. See the
is_terminal and utility functions in tictactoe.js for more detailed
instructions. (2 pts)
Create a function to play tic-tac-toe, using the Minimax algorithm. Modify the template function tictactoe_minimax, provided in tictactoe.js, to accomplish this. (Note: You have already been provided a working recursive depth-first search implementation; you need only add Minimax to it.) (3 pts)
Use the provided tictactoe.htm file to play a few games against your code from (1b). Does it play the way you expect? Can you beat it?
Also, notice that the evaluated/expanded state counts are reported while you are playing a game. Record these values as you play. How do they change over the course of the game? Is this what you expected? Discuss. (1 pt)
Modify your algorithm to use alpha-beta pruning. (Copy your code from (1b) into the provided tictactoe_minimax_alphabeta function. Modify this.) (3 pts)
Repeat (1c) using your new function. (1pt)
Configure the game so the human player goes second (and make sure the initial board is empty). Set for standard MiniMax and start the game. Report how many nodes are expanded to calculate the first move. Repeat for MiniMax w/ Alpha-Beta Pruning.
How do the two algorithms compare? Are the results what you expected? Discuss.
move_expand_order, which controls the order in which different possible moves are examined. An alternate ordering has been provided but commented out. Uncomment this and repeat the above experiment. How do the results change? Try to explain why you get this result. (1pt)
Create (and submit in class) a report including answers to the asked questions and a printout of your code. Also, create a ZIP archive of your code files and submit it in the Homework 4 dropbox on Carmen.
Note: This assignment may be completed as a group of up to two people. Each group should submit a single report (with both names on it) and only one group member should submit the combined code to Carmen.
If you need to print out debug statements, you may use the console.log() function to print out to the browser’s debug console. To access this log, use Ctrl-Shift-J in Chrome or F12 in Firefox.
Alternately, you can use the helper_log_write() function (from tictactoe_helper.js) to output to the log region on the web page.
A debug function (and a button to run it) has been provided in tictactoe.js to help you if you need to run any code for testing purposes.
Extra Credit: Try improving on the ordering from (1f). Can you explain why your result works better?
0.5pts: Any improvement over the results from (1f).
1pt: Expands fewer than 50,000 nodes and can explain why the changes work.
2pts: Expands fewer nodes than any other student submission (and meets the requirements for getting 1pt)
2pts: Alternately, find the worst possible ordering (must expand more than 115,000 nodes).
(You may try for both 2pt options, but 2pts total is the max extra credit you may receive. Also, note that the node counts above assume Alpha > Beta.)
The extra credit must be done individually. Submit your ordering, expanded node count, and explanation on Carmen. A separate assignment/submission box has been created for this purpose.