> Strong
> players are said to be shifty, squeezing in a
> forcing move before
> answering an obvious thing, and so on.
it's pretty fun to watch an extremely strong
player. they'll make sure to use every ounce
of their sente before they give it up.
s.
On Fri, Nov 17, 2006 at 12:00:04PM -0700, Anders Kierulf wrote:
>
> I second that. Some statistics on the distance of a move from
> the previous move to back this up:
>
> 0-1: 21%
> 1-1: 12%
> 1-2: 9%
> 0-2: 6%
> 1-3: 4%
> x-y: Everything else is less than 2% each.
>
> This is based on thousands
> I agree that "proximity to last move" is an OK place to look
> for moves to search, and I also think that I would *not* use
> it as part of an evaluation function, that is, no extra value
> for that fact.
I second that. Some statistics on the distance of a move from
the previous move to back thi
On 17, Nov 2006, at 12:49 AM, Wodzu wrote:
Could You give an example of such pattern or maybe is there
somwhere a list of
common patterns?
I just got this last night from a Go-playing computer-programming
friend:
I found new English translations of very popular Japanese Go books
that
Orego speaks GTP, as does gnugo. I'd like to run a bunch of games
(say, 50) between them to see how many Orego wins. Does anyone have a
handy script (ideally bash or Python) for this?
Thanks,
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~dra
> > I doubt any serious Go programs base their move
> > selection on proximity
> > to the last move.
i think that some fairly serious go players base
their selection first on proximity to the last
move. if you assume tenuki, you are ignoring
the importance of the last move played. it's
of some f
Shouldn't base the entire game play on the last move.
But looking at the last move could be an excellent
search optimisation. Indeed, I think any serious Go
program "should" look closer at the last move. ;-)
The thing is that any local move is as important as
any other move in the board.
--- Ch
- Original Message -
From: "David Fotland" <[EMAIL PROTECTED]>
To: "'computer-go'"
Sent: Friday, November 17, 2006 12:37 AM
Subject: [computer-go] Proximity to last move
Most of the strong programs use pattern matching to select moves to try.
Usually there are some patterns that are
>>> My simple idea is to analyze first moves near the last move on board,
>>> ...
>>> Ofcourse we can extend this idea by gathering not only one last move but
>>> few of them and on this basis create priority queue.
>>
>> Sounds reasonable. But it will still require you to go through far too
>> man
- Original Message -
From: "Darren Cook" <[EMAIL PROTECTED]>
To: "computer-go"
Sent: Thursday, November 16, 2006 10:48 PM
Subject: Re: [computer-go] How to improve my minimax speed?
My simple idea is to analyze first moves near the last move on board,
...
Ofcourse we can extend this
- Original Message -
From: "Chris Fant" <[EMAIL PROTECTED]>
To: "computer-go"
Sent: Thursday, November 16, 2006 11:00 PM
Subject: Re: [computer-go] How to improve my minimax speed?
I doubt any serious Go programs base their move selection on proximity
to the last move.
Cool and how
11 matches
Mail list logo
