On 04/06/07, Darren Cook [EMAIL PROTECTED] wrote:
Does anyone know of UCT being used in games other than go, or outside
games altogether, such as travelling salesman problem, or some
business-related scheduling/optimizing/searching problem domain?
I am trying to use UCT for the game trax. I
Darren Cook wrote:
Does anyone know of UCT being used in games other than go, or outside
games altogether, such as travelling salesman problem, or some
business-related scheduling/optimizing/searching problem domain?
I have used it in a connect4 engine.
In case anyone else was interested, yes, the AAAI general game-playing
competition has just started. You can find instructions to join the mailing
list on the resources page at the site (games.stanford.edu) and evidently
the games from the competition are being broadcast live online. If it's
I don't have specific information, but I worked on GGP with that group for
the last two years, and I think I can probably get in touch with them. I'll
see what they're up to and get back to you.
-Nick
On 6/3/07, Peter Drake [EMAIL PROTECTED] wrote:
I don't know, but I'd like to try it on the
Darren Cook wrote:
Does anyone know of UCT being used in games other than go, or outside
games altogether, such as travelling salesman problem, or some
business-related scheduling/optimizing/searching problem domain?
Thanks,
Darren
Guillaume has one paper titled Monte-Carlo Tree Search in
I don't know, but I'd like to try it on the AAAI's general game-
playing competition. Does anyone know if it's still running? The only
site I could find gives a past date as Real Soon Now:
http://games.stanford.edu/competition.html
I didn't get any reply from the address listed. Does anyone
