Re: computer-go: prevent cheating

[engels@xxxxxxxxxx (Andre Engels)]

Sai To Wang wrote:

> "search-depth" is not exactly what I meant, what I'm trying to say is
> that all time_based decisions can be "sort" in 256 level (stage) or
> maybe more, and every stage can had a resulting move,since all the
> calculation is done one after another (will be very hard in multi-thread). 

However, in that case a 'cheater' can easily abuse the system: use a computer
program that is bad in finding the best move, but can spawn a lot of
reasonable moves in a short span of time (deterministically), and let it
choose (say) 100 moves. Then let the human user choose one of these moves.
The computer sends the move plus a number from 1 to 100 being the place this
move has on its move list.


-- 
Andre Engels, engels@xxxxxxxxxxxxxxxxx, ICQ #6260644
http://www.win.tue.nl/cs/fm/engels/index_en.html

A child is not a glass that is filled, but a fire that is set ablaze.
						- Maria Montessori