![]() Suppose maximizer takes first turn which has worst-case initial value =- infinity, and minimizer will take next turn which has worst-case initial value = +infinity. In the below tree diagram, let's take A is the initial state of the tree. Step-1: In the first step, the algorithm generates the entire game-tree and apply the utility function to get the utility values for the terminal states. Following are the main steps involved in solving the two-player game tree: At the terminal node, the terminal values are given so we will compare those value and backtrack the tree until the initial state occurs.This algorithm applies DFS, so in this game-tree, we have to go all the way through the leaves to reach the terminal nodes.Maximizer will try to get the Maximum possible score, and Minimizer will try to get the minimum possible score.In this example, there are two players one is called Maximizer and other is called Minimizer.Below we have taken an example of game-tree which is representing the two-player game. ![]()
0 Comments
Leave a Reply. |