Faculty Advisor

Sarkozy, Gabor N

Faculty Advisor

Selkow, Stanley M.

Center

Budapest, Hungary

Abstract

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.

Publisher

Worcester Polytechnic Institute

Date Accepted

April 2008

Major

Computer Science

Project Type

Major Qualifying Project

Accessibility

Unrestricted

Advisor Department

Computer Science

Share

COinS