[computer-go] How to improve my minimax speed?

[Nick Wedd]

In message <269449.10831.qm at web50314.mail.yahoo.com>, Eduardo Sabbatella 
<eduardo_sabbatella at yahoo.com.ar> writes
>But...
>
>Which evaluation function for alfa-beta pruning?

The same evaluation function that you are using already.

Your original posting refers to "branching factor".  If you are 
concerned about branching factor, you are, presumably, using a tree 
search, with an evaluation function.  However you are doing this, so 
long as you are searching at least two plies deep, it will run 
significantly faster with alpha-beta pruning than without it.

>Perhaps I'm missing something, but alfa-beta pruning
>implies not perfect solution at all, because
>evaluation function is not perfect.

Alpha-beta pruning will not replace your evaluation function by a 
perfect one  :-)
It will reduce the number of nodes that you need to evaluate.

Nick
-- 
Nick Wedd    nick at maproom.co.uk