Question: Suppose that two computer algorithms A and B are playing tic-tac-toe against each other. Algorithm A is plain minimax search. a. If algorithm B is

Suppose that two computer algorithms A and B are playing tic-tac-toe against each other. Algorithm A is plain minimax search.

a. If algorithm B is also plain minimax, does algorithm A always follow the best possible strategy?

b. Can you make up an algorithm B for which algorithm A (i.e., plain minimax) does not find the best possible strategy? I.e., can you make up an algorithm B such that, if the designers of A knew that their opponent uses this algorithm B, the designers of A could replace minimax with a better strategy?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!