RE: [computer-go] citation

["Mark Boon" <tesuji@xxxxxxxxx>]

Goliath does. It 'skips' the diagonal part of the ladder, saving on average
80% of the reading time. But this way it can theoretically get the wrong
answer in some really obscure cases. This is a weakness I happily accept in
favour of the considerable speed-up.

   Mark Boon

-----Original Message-----
From: computer-go-bounces@xxxxxxxxxxxxxxxxx
[mailto:computer-go-bounces@xxxxxxxxxxxxxxxxx]On Behalf Of Darren Cook
Sent: Thursday, July 15, 2004 2:41
To: evand@xxxxxxxxxxxxxxxxx; computer-go
Subject: Re: [computer-go] citation


> So, what exactly is wrong with using John's definition, and applying
> the term "ladder" to it?  That seems the most natural thing to call
> it, and also the most useful definition to attach to the term.

I've always referred to it as "2-lib tactical searching".

With the stricter ladder definition you could scan out along a diagonal to
read the ladder. Or at least jump to the point where you have to read out
something special.

Having said that I read ladders with general tactical search code - messing
around with special code has never seemed worth it. Do any of the strong
programs do special ladder handling?

Darren
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/

_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/