When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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. [2]

  3. 24-cell - Wikipedia

    en.wikipedia.org/wiki/24-cell

    Net. In four-dimensional geometry, the 24-cell is the convex regular 4-polytope [1] (four-dimensional analogue of a Platonic solid) with Schläfli symbol {3,4,3}. It is also called C 24, or the icositetrachoron, [2] octaplex (short for "octahedral complex"), icosatetrahedroid, [3] octacube, hyper-diamond or polyoctahedron, being constructed of octahedral cells.

  4. Mathematical chess problem - Wikipedia

    en.wikipedia.org/wiki/Mathematical_chess_problem

    The domination problems are also sometimes formulated as requiring one to find the minimal number of pieces needed to attack all squares on the board, including occupied ones. [6] For rooks, eight are required; the solution is to place them all on one file or rank. The solutions for other pieces are given below.

  5. Nonogram - Wikipedia

    en.wikipedia.org/wiki/Nonogram

    Add the clues together, plus 1 for each "space" in between. For example, if the clue is 6 2 3, this step produces the sum 6 + 1 + 2 + 1 + 3 = 13. Subtract this number from the total available in the row (usually the width or height of the puzzle). For example, if the clue in step 1 is in a row 15 cells wide, the difference is 15 - 13 = 2.

  6. Mutilated chessboard problem - Wikipedia

    en.wikipedia.org/wiki/Mutilated_chessboard_problem

    A domino placed on the chessboard will always cover one white square and one black square. Therefore, any collection of dominoes placed on the board will cover equal numbers of squares of each color. But any two opposite squares have the same color: both black or both white. If they are removed, there will be fewer squares of that color and ...

  7. Regular complex polygon - Wikipedia

    en.wikipedia.org/wiki/Regular_complex_polygon

    The rank 2 solutions that generate complex polygons are: ... Real square G(3,1,2) 3 [4] 2: 18: 6: 6(18)2 ... G 4 =G(1,1,2) 3 [3] 3 <2,3,3> 24: 6: 3(24)3 ...

  8. AOL Mail

    mail.aol.com

    Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!

  9. Complex polytope - Wikipedia

    en.wikipedia.org/wiki/Complex_polytope

    The rank 2 solutions that generate complex polygons are: ... Real square G(3,1,2) 3 [4] 2: 18: 6: 6(18)2 ... {3,4} {6} Real 24-cell: G 30 2 [3] 2 [3] 2 [5] 2 = [3,3,5]