In the last few weeks I have been investigating
Monte-Carlo (MC) game tree search on a rather abstract
level. Especially I was able to "reproduce" the
following behaviour of MC in a very clear model:
MC is playing most "goal-directed" ("zielgerichtet"
in German) when the position is balanced or when
the side of MC is slightly behind. However, when
MC is clearly ahead or clearly behind it is playing rather
lazy.
Does someone here know, if there are or have been
investigations on this topic in existing papers or
projects (for instance in the context of computer go)?
Thanks in advance for all replies!
Ingo Althofer
--
Psssst! Schon das coole Video vom GMX MultiMessenger gesehen?
Der Eine für Alle: http://www.gmx.net/de/go/messenger03
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
