Only papers I can recall are from seventies (assuming you mean academic
papers) from Wilcoxx. I may have electrical copies. Not sure though. I
managed to find some of them from ACM site.
That paper described position based approach where each and every stage was
stored into datastructure, kinda
There is a paper about that in
http://hal.inria.fr/inria-00369783/en/
and Tristan Cazenave published something around that also.
(these two works are about the automatic building of opening book in
self-play)
See also the references in the PDF above.
Best regards,
Olivier
Only papers I can
In message 1257750292.4af7bf140b...@webmail.lclark.edu, Jessica
Mullins jmull...@lclark.edu writes
Hi,
I am wondering what is the best way to build a Joseki Book? I am a student at
Lewis Clark College and am working with Professor Peter Drake to build a
Joseki Book for the program Orego.
you could always take a joseki dictionary and build the trees by hand,
if you feel that you're strong enough to work out the most common
variations for the most common opening situations.
s.
2009/11/9 Olivier Teytaud teyt...@lri.fr:
There is a paper about that in
Le 09/11/2009 à 08:04, Jessica Mullins a écrit :
Hi,
I am wondering what is the best way to build a Joseki Book? I am a student at
Lewis Clark College and am working with Professor Peter Drake to build a
Joseki Book for the program Orego.
Right now I am extracting moves from professor
On Mon, Nov 09, 2009 at 02:46:11PM +0100, Alain Baeckeroot wrote:
Le 09/11/2009 à 08:04, Jessica Mullins a écrit :
Hi,
I am wondering what is the best way to build a Joseki Book? I am a student
at
Lewis Clark College and am working with Professor Peter Drake to build a
Joseki
On Nov 9, 2009, at 2:39 AM, Nick Wedd wrote:
On a broader level - it depends what you are trying to do. If you
want Orego to play well in the long term, getting it to play good
moves (what a professional would acknowledge as good) in the josekis
must be a good thing. But there is the
Many of us have concluded that, with RAVE, there is no need for a UCT
exploration term:
http://computer-go.org/pipermail/computer-go/2009-June/018773.html
Is there a published source on this result that I could cite?
Thanks,
Peter Drake
http://www.lclark.edu/~drake/
One approach might be to combine some well-known joseki and fuseki books with
such books as 100 tips for Amateur Players, which explain some of the
pitfalls, tricks, and traps behind popular joseki. Nihon Kiin publishes some
detailed and thorough joseki books.
Slate and Shell published a
From: Alain Baeckeroot alain.baecker...@laposte.net
Le 09/11/2009 à 08:04, Jessica Mullins a écrit :
Hi,
I am wondering what is the best way to build a Joseki Book? I am a student at
Lewis Clark College and am working with Professor Peter Drake to
http://computer-go.org/pipermail/computer-go/2009-June/018773.html
As I've often said something related to that (e.g. in
http://hal.inria.fr/inria-00369786/fr/ ) I'd like to be more precise. What
follows is for binary deterministic games, and I precise at the beginning
that this is not
Quoting terry mcintyre terrymcint...@yahoo.com:
I don't knwo how to build such a book, but
Kogo's Joseki dictionnary is a huge .sgf file containging joseki + trick
moves and punishment. Maybe it can be parsed to extract only joskis.
The problem with josekis are that most of the moves in them
By result, do you mean this observation or a quest for an explanation?
If you merely wish to say that many/most current UCT programs have no
need for an exploration term, then that is a context-specific (e.g.
not for the E-E in Go paper) heuristic or experimental statement,
not a formal one. A
Magnus Persson wrote:
I think it may make more sense to break down the joseki into common
local patterns
Patterns are doubtful. Even the best shape can be dead.
--
robert jasiek
___
computer-go mailing list
computer-go@computer-go.org
I'm actually looking for something weaker than what Olivier has
offered: a published report of the empirical finding that (for some
programs, at least) an exploration coefficient of zero works best.
Peter Drake
http://www.lclark.edu/~drake/
On Nov 9, 2009, at 10:15 AM, Olivier Teytaud
I don't know if a post in the computer-go mailing list is a report, but you
can find numbers in this post:
http://computer-go.org/pipermail/computer-go/2008-May/014854.html
From the numbers I would say that it shows that all sufficiently small
constants
are equivalent - maybe more experiments
On Mon, Nov 09, 2009 at 10:18:25AM -0800, Peter Drake wrote:
I'm actually looking for something weaker than what Olivier has
offered: a published report of the empirical finding that (for some
programs, at least) an exploration coefficient of zero works best.
I think you could use Combining
My mistake. The comment was directed to the original post and not
yours. I was being too slow writing a reply.
(yikes, i really dislike the formatting of the
http://hal.inria.fr/inria-00369786/fr article)
On 11/9/09, Olivier Teytaud olivier.teyt...@lri.fr wrote:
Hi; I'd like to answer your post
On Mon, Nov 09, 2009 at 07:42:46PM +0100, Cenny Wenner wrote:
My mistake. The comment was directed to the original post and not
yours. I was being too slow writing a reply.
(yikes, i really dislike the formatting of the
http://hal.inria.fr/inria-00369786/fr article)
Which, incidentally,
Perfect!
The very similar paper (by most of the same authors) Adding expert
knowledge and exploration in Monte-Carlo Tree Search contains the key
passage:
In MoGo, the constant in front of the exploration term was not null
before the introduction of RAVE values in [10]; it is now 0.
From what David Fotland has said, Many Faces will lay out whole josekis as
single moves in its searches, which seems like a great way of biasing the
mcts tree early on.
On Mon, Nov 9, 2009 at 13:13, Robert Jasiek jas...@snafu.de wrote:
Magnus Persson wrote:
I think it may make more sense to
The tradition program did this, because it only did a very shallow global
search. So in a two play global search, an entire joseki sequence would be one
ply.
In the MCTS version, joseki moves get a strong bias, but there is no special
handling of sequences.
David
From:
David Fotland wrote:
in a two play global search, an entire joseki sequence would be one ply.
This works only ALA the programs don't depart from stored josekis,
right? How could they adapt to non-standard global side-conditions while
treating a joseki as fixed one-ply sequence? They must
Two ply (typo) was an example. The original program did one ply global search
plus local quiescence. Local quiescence for a joseki move was to complete a
few sequences. Obviously not ideal, but better than trying to evaluate a
position in the middle of a joseki.
David
-Original
24 matches
Mail list logo
