> OTOH the tree search part is entirely different, very heavy on floating > point arithmetics (IIRC, most of the time in this part is spent taking > the square roots; overally, tree search is taking 1/4 to 1/3 of the > runtime, a significant amount; of course the balances may be different > in other programs with heavier/lighter playouts).
are these float operations necessary? if they're taking place at the same time as independent integer operations, pipelining on some cpus could take advantage of that, but otherwise it seems like a lookup table would be faster. just curious, s. _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
