Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Problem 1 Consider the two - player game described in the figure below. table [ [ 1 , 2 , 3 , 4 ,
Problem
Consider the twoplayer game described in the figure below.
tableAB
The figure illustrates the starting position of a simple game. Player A moves first. The two players take turns moving, and each player must move his token to an open adjacent space in either direction. If the opponent occupies an adjacent space, then a player may jump over the opponent to the next open space if any. For example, if is on and is on then A may move back to The game ends when one player reaches the opposite end of the board. If player A reaches space first, then the value of the game to is ; if player reaches space first, then the value of the game to is
Draw the complete game tree see Chapter slide pages and for game tree as shown in the figure below. For each terminal state leaf node write its game value eg the utility value in Chapter slide p For each loop state a state that already appears on any path to the root write a question mark beside the state, and stop expanding from the state.
Page
Redraw your game tree as shown in the figure below. Do not include loop states. Run minimax algorithm as in Chapter slide p You must write all minimax values for all nodes.
Does your minimax algorithm ran on Problem give an optimal decision?
Problem
Rum lefttoright ap pruning algorithm on the graph below: With this algorithm, you always explore the left child of a node first. All the examples in the power point slides used the lefttoright pruning algorithm.
Run righttoleft pruning algorithm on the graph below: With this algorithm, you always explore the right child of a node first.
Please clearly show your intermediate steps with your scratch works otherwise no full credit will be given. For instance, you need to show any changes of minimax, and or values of nodes, and pruned branches.
Page
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started