computer-go: [Question] Alpha-Beta Pruning & Null Move

["Xu, Mousheng (SEA)" <Mousheng.Xu@xxxxxxxxxxxxxxxxxxxxx>]

Dear all,

I just don't see how alpha-beta pruning can save mentionable calculation.
The most time consuming part is to evaluate the leaf nodes. With alpha-beta
pruning, you still have to calculate every leaf node. I agree that
Alpha-beta pruning can reduce tree size, which then can save some memory.
But does it save calculation?

Null moves not only applies to "pass"es, but also applies to local
calculation. If you are focusing calculation around some local area, you may
want to evaluate the cases when either you or your opponent chooses to play
somewhere else. I cannot find any good references on the Web about null
moves. Does any one here has a pointer?

Thanks a lot.

-- Mousheng Xu



The information contained in this email is intended for the
personal and confidential use of the addressee only. It may
also be privileged information. If you are not the intended
recipient then you are hereby notified that you have received
this document in error and that any review, distribution or
copying of this document is strictly prohibited. If you have
received  this communication in error, please notify Celltech
Group immediately on:

+44 (0)1753 534655, or email 'is@xxxxxxxxxxxxxxxxx'

Celltech Group plc
216 Bath Road, Slough, SL1 4EN, Berkshire, UK

Registered Office as above. Registered in England No. 2159282