Which search is equal to minimax search but eliminates the branches that can't influence the final decision?
a) Depth-first search
b) Breadth-first search
c) Alpha-beta pruning
d) None of the mentioned
Submitted by: Administratorc) Alpha-beta pruning
Explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that can't influence the final decision.
Submitted by:
Explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that can't influence the final decision.
Submitted by:
Read Online Artificial Intelligence Games Job Interview Questions And Answers
Top Artificial Intelligence Games Questions
| ☺ | What is AI Checkers? |
| ☺ | What is Game Playing AI? |
| ☺ | What is AI Backgammon? |
| ☺ | Consider this: after a while Tesuaros temporal difference program will likely stop learning, so does this means that it lost its intelligence? |
| ☺ | Is this artificial intelligence lives over the other software programs and their flexibility? |
Top New Artificial Intelligence Categories
| ☺ | Virtual Assistant Interview Questions. |
| ☺ | Artificial Intelligence Robotics Interview Questions. |
| ☺ | AI Fuzzy Logic Interview Questions. |
| ☺ | Artificial Intelligence Neural Networks Interview Questions. |
| ☺ | Advanced Embedded Systems Interview Questions. |
