4.4. Reasoning Networks (2)
In the preceding section, we discussed an uncertain reasoning model in OR-graph. An uncertain reasoning model in AND/OR graph is now discussed. Let’s, first, consider the following example.
In two players, perfect-information games, such as chess, checkers and GO, there are two adversary players who alternate in making moves. At each turn, each player makes one move according to the rules of the game which define both what moves are legal and what effect each possible move will have. Each player has complete information about his opponent’s position and all available choices, viewing the opponent’s failure as his own success. The game begins from a specified initial state and ends in a position that can be ...