Write a program to play 3D tic-tac-toe (see Exercise 12). Your program should employ the negamax algorithm. Test your program in machine vs. man mode, using a testing procedure similar to programming Exercise 4.
What is the Prisoner’s Dilemma? Why has it received so much attention? Define the following terms. a. Nash equilibrium b. Pareto Optimal q61: Comment on the difference in expressive power between the propositional logic and the FOPL.
What limitations do you believe logic has as an AI knowledge representation language?
How might propositional logic be altered if the Law of excluded middle were not a theorem?
Write a program to play tic-tac-toe (minimax is sufficient here). Your program should play in machine vs. machine mode (the computer makes both moves). The first player should follow a procedure that goes three levels into the game tree before heuristic evaluation is employed, whereas the second player should go only two levels deep.
Comment on the results of play after 50 games.
Consider the game of three-dimensional tic-tac-toe. As usual the X and O players alternate and the object of play is to get three in a row on any row, column, or diagonal.
a. Compare the complexity for 3-D tic-tac-toe with the more traditional 2-D version of the game described in the chapter.
b. Develop a heuristic suitable for evaluation of nonterminal nodes.
Try it now!
How it works?
Follow these simple steps to get your paper done
Place your order
Fill in the order form and provide all details of your assignment.
Proceed with the payment
Choose the payment system that suits you most.
Receive the final file
Once your paper is ready, we will email it to you.