something i've played with a little bit: only look at algorithms with the following property:
* they every so often update an in-memory score for each board position. you can then run a timing loop around this and just make the highest-scoring valid move the play. you can use a signal handler to dump the list at any time. s. 2009/7/7 terry mcintyre <terrymcint...@yahoo.com>: > Digesting Don's remarks, it seems that a reasonable method would start with > equal numbers of simulations. It could then proceed to try various > optimizations, and compare algorithms which use equal time. > > It makes perfect sense for the ultimate goal to be "better performance using > the same time or less", but it might be easier to progress stepwise - first > tweak the top-level design, then tweak the performance - in order to > separate out the different inputs to the experiment. > > Terry McIntyre <terrymcint...@yahoo.com> > > “We hang the petty thieves and appoint the great ones to public office.” -- > Aesop > > > > _______________________________________________ > 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/
