d pretend that Mogo_16 has 2 wins and 1 loss against Mogo_15
before any actual games are played. This would seed Mogo_16 into about the
right rank, and it would immediately start playing high information games
instead of games against opponents that are too weak to yield much
information.
Chuck Pau
people.csail.mit.edu/bkph/articles/APE_continuous.pdf
Chuck Paulson
www.PuffinwareLLC.com <http://www.puffinwarellc.com/>
iMetaSearch - indexing and clustering search results with Latent Semantic
Analysis
___
computer-go mailing list
comput
zation. I knew, of
course, that Ruby is slower than C++ but a factor of 300 is amazing. It
helps to have explicit control of memory and mature C compilers that
generate fast code.
I am still wondering how Ruby could be so much slower than C++. Perhaps this
problem is just not suited fo
