Earlier quoted context omitted.
I "got lucky" in the sense that my experiences have primed me to recognize that particular kind of question. If the article had actually modified the question framing at all, rather than just copying the existing one, it maybe wouldn't have worked that way. It's the same reaction I have to the Monte Hall problem: I don't have to think or be clever to get the right answer. So naturally you couldn't effectively teach m…
The question could have read the exact same way, with a different final rule as the answer. Without testing at all, you wouldn't/couldn't know that...and so you didn't solve it..you just guessed...
A Quick Puzzle to Test Your Problem Solving
301–310 of 311 posts
Re: A Quick Puzzle to Test Your Problem Solving
#302It's ironic that these facts are not mentioned considering the article is about confirmation bias.
Re: A Quick Puzzle to Test Your Problem Solving
#303There's a puzzle with a doorman, there's a few distracting clues where the answer is actually very simple.
It doesn't offer confirmation bias though, and it took some time to figure it out.
I consider it a very similar test.
So one could actually construct such a test without the confirmation bias part, and then look at how long it takes for people to realize the simple model.
Re: A Quick Puzzle to Test Your Problem Solving
#304Math person here. I'm curious to know if anyone used decimal numbers in their tests and if negative numbers were used. The rule is increasing real numbers and one can guess that the rule is increasing numbers without realizing this includes all real numbers and not just integers. In addition to getting it right did you use an exhaustive set of tests?
Re: A Quick Puzzle to Test Your Problem Solving
#305It responds "No" to (10000000000000000, 10000000000000001, 10000000000000002) so the rule is not so simple after all :)
Responds "Yes" to 9007199254740990, 9007199254740991, 9007199254740992 but "No" to 9007199254740991, 9007199254740992, 9007199254740993 Presumably this is due to how Javascript handles integers, i.e. it uses the integer part of a float64, to wit > parseInt('9007199254740992') 9007199254740992 > parseInt('9007199254740993') 9007199254740992 Edit: I think this is the code that actually reads the numbers the user enters…
on line 588 is the comparison
var rightWrong = (inputData[0]
With a variable declaration on line 545 being var inputData = [NaN, NaN, NaN],
revealed = false,
right = "Yes!",
wrong = "No.";
And `inputData` is changed on text input on line 662 $("#g-input input").each(function(i) {
var val = $(this).val();
inputData[i] = $.isNumeric(val) ? Number(val) : NaN;
});
It uses the `Number()` function to convert from the input text to an actual number, so it can convert any number format defined by ES5[1] or ES6[2]. So in ES6 you can use binary (0b, 0B) and octal (0o, 0O) formatting along with exponential (1e-2) and hex (0x, 0X). Binary and octal works for me currently on Chrome 43 OS X.[0] http://graphics8.nytimes.com/newsgraphics/2015/06/16/puzzle/...
[1] http://www.ecma-international.org/ecma-262/5.1/#sec-9.3.1
[2] http://www.ecma-international.org/ecma-262/6.0/#sec-7.1.3.1
Re: A Quick Puzzle to Test Your Problem Solving
#306I ran this experiment for a while (code at https://github.com/darius/wason , derived from http://lesswrong.com/lw/g2/positive_bias_test_c_program/ ). In my logs most people seem to have gotten it right, though presumably that's because it was linked from LessWrong. For an actually-fun game like this, see https://en.wikipedia.org/wiki/Zendo_%28game%29 .
Re: A Quick Puzzle to Test Your Problem Solving
#307Earlier quoted context omitted.
My process was: [3 5 7] [7 5 3] [8 4 2] [5 7 3] [1 2 3] [1 1 1] [0 1 2] At that point I could've done some more to be really certain, but felt confident enough and guessed (correctly).
So you limited yourself to non-negative integers, and had no idea what negative numbers or fractions would do.
So after the tests listed above I felt confident enough to guess.
Re: A Quick Puzzle to Test Your Problem Solving
#308Earlier quoted context omitted.
I tried floating point numbers. Also, at 28 decimal places, the test breaks; it's not arbitrary precision. So, technically, the answer isn't simply "any ascending sequence of numbers".
The slightly-shorter 0.60000000000000000, 0.60000000000000001, 0.60000000000000002 will break it too, for what it's worth. If you punch those in to a Javascript console, you can see that the FP representation of all three is 0.6.
Re: A Quick Puzzle to Test Your Problem Solving
#309Earlier quoted context omitted.
It works for floating point numbers -- 0.01 0.02 0.04 for example. So it's a geometric series that has to start with a positive number and doubles. (The submit button and the show the answer button were broken for me.)
That's unintentionally hilarious.
But the submit button being broken did kind of suck.