In this project we designed and developed improvements for the random search algorithm UCT with a focus on improving performance with directed acyclic graphs and groupings. We then performed experiments in order to quantify performance gains with both artificial game trees and computer Go. Finally, we analyzed the outcome of the experiments and presented our findings. Overall, this project represents original work in the area of random search algorithms on directed acyclic graphs and provides several opportunities for further research.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Childs, Benjamin Edward
• Brodeur, James H.

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-041808-104235

Advisor

• Selkow, Stanley M.
• Sarkozy, Gabor N

Year

• 2008

Center

• Budapest, Hungary Project Center - MQP

Date created

• 2008-04-18

Location

• Budapest

Resource type

• Major Qualifying Project

Major

• Computer Science

Rights statement

• In Copyright