[computer-go] Hydra search techniques

[Petri Pitkänen <petri.t.pitkanen@xxxxxxxxx>]

Hello,

Not really a Go issue but, since I think i will get the answer here :):
- I saw in Hydra web page that hydra uses pruning techniques to reduce 
the search tree. And since with same evaluation speed hydra gets quite 
lot deeper than Deep Blue I can see that  it does. Does that mean normal 
alpha-beta optimizations or are some moves completely pruned i.e. not 
part of the search at all? I saw such a claim made for Deep Junior. To 
me this is bit like old times. In seventies all computers use plausible 
move generators.

- In this "controversial" second game between Kasparov and Deep Blue, 
Deep Blue makes "un-computer like move". Whatever that means.  What move 
would hydra make? Would it take the bait or make nice positional 
defensive move?


Petri Pitkänen

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