When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Missing square puzzle - Wikipedia

    en.wikipedia.org/wiki/Missing_square_puzzle

    The missing square puzzle is an optical illusion used in mathematics classes to help students reason about geometrical figures; or rather to teach them not to reason using figures, but to use only textual descriptions and the axioms of geometry. It depicts two arrangements made of similar shapes in slightly different configurations.

  3. Nine dots puzzle - Wikipedia

    en.wikipedia.org/wiki/Nine_dots_puzzle

    The "nine dots" puzzle. The puzzle asks to link all nine dots using four straight lines or fewer, without lifting the pen. The nine dots puzzle is a mathematical puzzle whose task is to connect nine squarely arranged points with a pen by four (or fewer) straight lines without lifting the pen or retracing any lines.

  4. Circle packing in a square - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_square

    Solutions (not necessarily optimal) have been computed for every N ≤ 10,000. [2] Solutions up to N = 20 are shown below. [2] The obvious square packing is optimal for 1, 4, 9, 16, 25, and 36 circles (the six smallest square numbers), but ceases to be optimal for larger squares from 49 onwards.

  5. MacMahon Squares - Wikipedia

    en.wikipedia.org/wiki/MacMahon_Squares

    The goal is to arrange the squares into a 4 by 6 grid so that when two squares share an edge, the common edge is the same color in both squares. In 1964, a supercomputer was used to produce 12,261 solutions to the basic version of the MacMahon Squares puzzle, with a runtime of about 40 hours.

  6. 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.

  7. Pattern Blocks - Wikipedia

    en.wikipedia.org/wiki/Pattern_blocks

    [6] When Marion Walter, who was also part of the project in the 1960s spoke to Prenowitz in 1996, he said that he considered the allocation of one color to all blocks of a particular shape, much like Cuisenaire rods, which may have given him the idea, to be one of the innovative features of the blocks. Also important in his choice was that ...

  8. Pentomino - Wikipedia

    en.wikipedia.org/wiki/Pentomino

    For example, the French board game Blokus is played with 4 colored sets of polyominoes, each consisting of every pentomino (12), tetromino (5), triomino (2) domino (1) and monomino (1). Like the game Pentominoes, the goal is to use all of your tiles, and a bonus is given if the monomino is played on the last move. The player with the fewest ...

  9. Wheat and chessboard problem - Wikipedia

    en.wikipedia.org/wiki/Wheat_and_chessboard_problem

    The first square of the second half alone contains one more grain than the entire first half. On the 64th square of the chessboard alone, there would be 2 63 = 9,223,372,036,854,775,808 grains, more than two billion times as many as on the first half of the chessboard.