$1", $pretty_hypothesis);
$pretty_hypothesis = preg_replace("/\b([nN])\b/", "n", $pretty_hypothesis);
// save this code
$user_code = preg_replace("/\b([nN])\b/", "n", $hypothesis);
// define functions from code strings
function f_hidden($n) {
global $hidden_code;
$code = preg_replace("/n/", $n, $hidden_code);
eval("\$res = intval($code);");
return $res;
}
function f_user($n) {
global $user_code;
$code = preg_replace("/n/", $n, $user_code);
eval("\$res = intval($code);");
return $res;
}
// fill up data points while hypothesis fits
$sequence = Array();
$hints_remaining = $num_hints;
for($n = 1; $n < $max_terms; $n++) { // may terminate early!
$hidden = f_hidden($n);
$user = f_user($n);
if($hidden != $user) {
$hints_remaining--;
$user = "$user";
}
if(0 == $hints_remaining) {
break;
}
$sequence[] = Array($n,$hidden,$user);
} // for n
// check victory
if($n == $max_terms) {
$victory = true;
}
////
//// RENDERING
////
?>
Sequence Sleuth
Sequence Sleuth
Discover a formula that fits the provided data points. As your model improves, more data points will be revealed.
Experiment
| Hypothesis: | f(n) = |
| Victory! | Your hypothesis fits the data beyond the threshold for a layman to actually care. |
Results
| | Data | Guess |
f($index) = | $data | $hypo | \n");
}
?>