So I was thinking.  I wonder if anyone has written a go engine that can play
using only the time that it takes their opponent to think.  It seems some of
your monte carlo programs would be able to do this decently well.  Has
anyone tried to see how much it hurts the ranking of a program?  I would
estimate that it would lose only 600 ELO = around 3 doublings of thinking
time.  That is assuming the engine spends on *proper average 1/8 the time it
has trying the move that the opponent picked.  Proper average I am defining
to be: e^(mean(ln(time spent))).  So essentially, the expected ELO of the
move picked.  Any thoughts or data?

- Nick
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Reply via email to