[phpBB Debug] PHP Warning: in file [ROOT]/phpbb/auth/provider/godb.php on line 137: Undefined array key "PHPSESSID"
[phpBB Debug] PHP Warning: in file [ROOT]/includes/functions.php on line 4129: Cannot modify header information - headers already sent by (output started at [ROOT]/includes/functions.php:3008)
[phpBB Debug] PHP Warning: in file [ROOT]/includes/functions.php on line 4129: Cannot modify header information - headers already sent by (output started at [ROOT]/includes/functions.php:3008)
[phpBB Debug] PHP Warning: in file [ROOT]/includes/functions.php on line 4129: Cannot modify header information - headers already sent by (output started at [ROOT]/includes/functions.php:3008)
[phpBB Debug] PHP Warning: in file [ROOT]/includes/functions.php on line 4129: Cannot modify header information - headers already sent by (output started at [ROOT]/includes/functions.php:3008)
goproblems.com • Exhaustive mode
Page 1 of 1

Exhaustive mode

Posted: Sun May 13, 2012 3:50 pm
by Weichi
When players are working on problems at this website, the system usually randomly selects one move among all of it best moves. I was wondering if we could have an exhaustive mode, in which the player can try the problem multiple times and each time the computer responds with a different best move. After all the best moves of the computer has been exhausted, the round is over (or we say the problem is solved). I think this will help players better understand the problems.

Re: Exhaustive mode

Posted: Sun May 13, 2012 7:22 pm
by adum
that would be a nice improvement.

Re: Exhaustive mode

Posted: Mon May 14, 2012 4:46 am
by Weichi
Maybe we can also have an exhaustive mode on the player side. That is, after the player solves the problem with one move, the system marks that move and tells the player to try other moves, if there are multiple ways to solve the problem.

Re: Exhaustive mode

Posted: Mon May 14, 2012 6:57 am
by adum
yes, that's probably the best way to implement it. unfortunately, it's rather a lot of work...

Re: Exhaustive mode

Posted: Mon May 14, 2012 7:43 am
by Weichi
I can imagine it must be a lot of work. But maybe we can start with a mode that is only exhaustive for the first step. In that case, we only need a loop instead of a tree-traversal algorithm.