Minimax algorithm (Figure 6.3) computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.
a) True
b) False
Submitted by: Administratora) True
Explanation: Refer definition of minimax algorithm.
Submitted by:
Explanation: Refer definition of minimax algorithm.
Submitted by:
Read Online Artificial intelligence Job Interview Questions And Answers
Top Artificial intelligence Questions
| ☺ | What is an agent? |
| ☺ | What are best graduate schools for AI? |
| ☺ | What is the difference between classical AI and statistical AI? |
| ☺ | What are good programming languages for AI? |
| ☺ | What are partial, alternate, artificial, compound and natural key? |
Top Coding/Programming Categories
| ☺ | Python Interview Questions. |
| ☺ | OOP Interview Questions. |
| ☺ | Software engineering Interview Questions. |
| ☺ | PHP Interview Questions. |
| ☺ | VBA (Visual Basic for Applications) Interview Questions. |
