Discussion
What are the four phases of a Monte Carlo tree search iteration?
Answer: D
Each iteration descends the existing tree by a selection rule, adds a node, plays a random game from it and propagates the result back up the path. Repeating this many thousands of times concentrates effort on the promising lines. The other lists mix real terms from other algorithms. A loop of four clearly named phases makes an otherwise unfamiliar algorithm easy to implement correctly, which is part of why the method spread so quickly.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development