Re: computer-go: What makes a ladder

[Don Dailey <drd@xxxxxxxxxxxxxxxxxxxxx>]

> Instead of blindly following rules, you should try to read the ladder.
> As it has a branching factor of 1 for each black move and 2 for each
> white move, this is not difficult.

But a  rule is still far cheaper,  if you can  find one  that actually
works.  Most of the  programmers  have complained that  evaluation  is
really expensive, so   I  don't see where  it  hurts  trying  to  find
something cheaper.  Even if you don't succeed, you are likely to learn
something.


Don




   Date: Fri, 2 Feb 2001 14:33:08 +0000
   From: Nick Wedd <Nick@xxxxxxxxxxxxxxxxx>
   References: <003901c08cb7$54ce8ba0$b39b7ed4@njoroge>
    <0kU0uZCtpne6Ew0g@xxxxxxxxxxxxxxxxx>
    <004d01c08d12$67a26e80$3c937ed4@njoroge>
   MIME-Version: 1.0
   X-Mailer: Turnpike Integrated Version 4.02 U <2JQI4ZxDiDMfZZvAyGkNIZYSCT>
   Sender: owner-computer-go@xxxxxxxxxxxxxxxxx
   Precedence: bulk
   Reply-To: computer-go@xxxxxxxxxxxxxxxxx
   Content-Type: text
   Content-Length: 700

   Njoroge <Njoroge@xxxxxxxxxxxxxxxxx> writes

   >I belive that you are wrong.
   >
   >The rules that fails the ladder is that the Opponent stone has less than 2
   >liberties.

   Instead of blindly following rules, you should try to read the ladder.
   As it has a branching factor of 1 for each black move and 2 for each
   white move, this is not difficult.
   >
   >-.-.-.-.-.-O-.-.-.-.-
   > . . . . O X . . . .
   > . . . O X X O X . .
   > . . O X X O . . . .
   > . O X X O . . . . .
   > . O X O . . . . . .
   > . . O . . . . . . .
   > . . . . . . . . . .
   >
   >The ladder has now been extended and it is black to play.  The correct
   >orientation of my original diagram is

   But white's last move was bad.

   Nick
   -- 
   Nick Wedd    nick@xxxxxxxxxxxxxxxxx