Faculty Advisor

Sarkozy, Gabor N

Faculty Advisor

Selkow, Stanley M.

Center

Budapest, Hungary

Abstract

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.

Publisher

Worcester Polytechnic Institute

Date Accepted

April 2010

Major

Computer Science

Project Type

Major Qualifying Project

Accessibility

Unrestricted

Advisor Department

Computer Science

Share

COinS