Title of the game: Below 9 Description of the game: Initial state = Number 0 Mov

Question

Title of the game:

Below 9

Description of the game:

Initial state = Number 0

Moves = Players perform moves in a sequential manner.Each player operates with numbers 1,2 and 3.During a move,a player adds to the current number any of the numbers from 1 to 3,but he/she cannot use the same number which was used by the opponent in the previous move.This means that if thde first player chooses 1,then the other one can choose 2 or 3.

Terminal states= The player,who exceeds 9,loses the game

Please help me to make game tree and apply min-max algorithm and alfa-beta algorithm.

Explanation / Answer

die at 9

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.