enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Wason selection task - Wikipedia

    en.wikipedia.org/wiki/Wason_selection_task

    The Wason selection task (or four-card problem) is a logic puzzle devised by Peter Cathcart Wason in 1966. [1] [2] [3] It is one of the most famous tasks in the study of deductive reasoning. [4] An example of the puzzle is: You are shown a set of four cards placed on a table, each of which has a number on one side and a color on the other.

  3. Three utilities problem - Wikipedia

    en.wikipedia.org/wiki/Three_utilities_problem

    There is even enough additional freedom on the torus to solve a version of the puzzle with four houses and four utilities. [21] [5] Similarly, if the three utilities puzzle is presented on a sheet of a transparent material, it may be solved after twisting and gluing the sheet to form a Möbius strip. [22]

  4. Water pouring puzzle - Wikipedia

    en.wikipedia.org/wiki/Water_pouring_puzzle

    By restricting ourselves to reversible actions only, we can construct the solution to the problem from the desired result. From the point [4,4,0], there are only two reversible actions: transferring 3 liters from the 8 liter jug to the empty 3 liter jug [1,4,3], and transferring 3 liters from the 5 liter jug to the empty 3 liter jug [4,1,3].

  5. Four fours - Wikipedia

    en.wikipedia.org/wiki/Four_fours

    For example, when d=4, the hash table for two occurrences of d would contain the key-value pair 8 and 4+4, and the one for three occurrences, the key-value pair 2 and (4+4)/4 (strings shown in bold). The task is then reduced to recursively computing these hash tables for increasing n , starting from n=1 and continuing up to e.g. n=4.

  6. Play free online Puzzle games and chat with others in real-time and with NO downloads and ... Spangram and Answers for Saturday, March 8. Parade. Today's Wordle Hint, Answer for #1358 on Saturday ...

  7. Tower of Hanoi - Wikipedia

    en.wikipedia.org/wiki/Tower_of_Hanoi

    That is to say: 5>4>3 (3 over 4 over 5) is valid; 5>4>2 (with 2 over 4) is invalid. Exactly 1 of the top labels (disk number or empty base) is even (for even n; otherwise exactly 1 is odd). A bit with the same value as the previous digit means that the corresponding disk is stacked on top of the previous disk.

  8. Missionaries and cannibals problem - Wikipedia

    en.wikipedia.org/wiki/Missionaries_and_cannibals...

    This is a shortest solution to the problem, but is not the only shortest solution. [ 4 ] , p. 291. If however, only one man can get out of the boat at a time and husbands must be on the shore to count as with his wife as opposed to just being in the boat at the shore: move 5 to 6 is impossible, for as soon as γ has stepped out b on the shore ...

  9. Metapuzzle - Wikipedia

    en.wikipedia.org/wiki/Metapuzzle

    An example Jumble-style word puzzle, where solving four anagrams allows the solver to then solve a fifth, using the circled letters of the previous answers Game designer Cliff Johnson defines a meta-puzzle as "a collection of puzzles that, when solved, each give a piece of a master puzzle."