Your question really boils down to a move ordering which is considered to be one of the biggest drivers in alpha-beta performance. With iterative deepening, you can use the results from the last alpha-beta search to help the next. AKA: search the previously best move first and go down the line. I'm still in the implementation process, but it seems reasonable to me.
-----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Wodzu Sent: Thursday, November 16, 2006 3:00 PM To: computer-go Subject: Re: [computer-go] How to improve my minimax speed? Greetings, I would like to thank You for all your sugestions. Some of them still awaiting implementation ;-) I've started from implementing Alpha-Beta pruning but I would like to ask You how to chose moves which should be evaluated first? My simple idea is to analyze first moves near the last move on board, for example: OOOOOOOOO OOOOOOOOO OOOYYYOOO OOOYXYOOO OOOYYYOOO OOOOOOOOO OOOOOOOOO If the last played move was on X than we firstly analyze positions "Y". Ofcourse we can extend this idea by gathering not only one last move but few of them and on this basis create priority queue. Any other ideas? Thanks for Your time. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/ _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
