We have developed the Gomba Testing Framework, a new platform for the comparative evaluation of search algorithms in large adversarial game trees. Gomba is simple, fast, extensible, objective, and can scale to larger trees than previous frameworks have been able to test against. We have implemented and tested a variety of Monte-Carlo based search algorithms using the framework and have analyzed their performance in relation to known metrics in computer Go. Finally, we have taken several solutions to the infinitely-many-armed bandit problem and adapted them to tree search. We have tested these variants in both Gomba and computer Go, and have shown that they can be effective in both cases.

• 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

• Schaeffer, John N.
• Bjorge, Daniel James

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-042810-054003

Advisor

• Selkow, Stanley M.
• Sarkozy, Gabor N

Year

• 2010

Center

• Budapest, Hungary Project Center - MQP

Sponsor

• MTA SZTAKI

Date created

• 2010-04-28

Ort

• Budapest

Resource type

• Major Qualifying Project

Major

• Computer Science

Rights statement

• In Copyright