When.com Web Search

  1. Ad

    related to: mathematical chess problems and solutions

Search results

  1. Results From The WOW.Com Content Network
  2. Mathematical chess problem - Wikipedia

    en.wikipedia.org/wiki/Mathematical_chess_problem

    A mathematical chess problem is a mathematical problem which is formulated using a chessboard and chess pieces. These problems belong to recreational mathematics. The most well-known problems of this kind are the eight queens puzzle and the knight's tour problem, which have connection to graph theory and combinatorics. Many famous ...

  3. Eight queens puzzle - Wikipedia

    en.wikipedia.org/wiki/Eight_queens_puzzle

    The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. There are 92 solutions. The problem was first posed in the mid-19th century.

  4. Chess puzzle - Wikipedia

    en.wikipedia.org/wiki/Chess_puzzle

    Some chess problems, like the eight queens puzzle or the knight's tour problem, have connections to mathematics, especially to graph theory and combinatorics. Many famous mathematicians have studied such problems, including Euler , Legendre , and Gauss .

  5. Mutilated chessboard problem - Wikipedia

    en.wikipedia.org/wiki/Mutilated_chessboard_problem

    The mutilated chessboard Unsuccessful solution to the mutilated chessboard problem: as well as the two corners, two center squares remain uncovered. The mutilated chessboard problem is a tiling puzzle posed by Max Black in 1946 that asks: Suppose a standard 8×8 chessboard (or checkerboard) has two diagonally opposite corners removed, leaving ...

  6. Longest uncrossed knight's path - Wikipedia

    en.wikipedia.org/wiki/Longest_uncrossed_knight's...

    The solution used dynamic programming and uses the fact that the solution should exhibit a cyclic behavior. Other standard chess pieces than the knight are less interesting, but fairy chess pieces like the camel ((3,1)-leaper), giraffe ((4,1)-leaper) and zebra ((3,2)-leaper) lead to problems of comparable complexity.

  7. Category:Mathematical chess problems - Wikipedia

    en.wikipedia.org/wiki/Category:Mathematical...

    Pages in category "Mathematical chess problems" The following 18 pages are in this category, out of 18 total. This list may not reflect recent changes. *

  8. Knight's tour - Wikipedia

    en.wikipedia.org/wiki/Knight's_tour

    The knight's tour problem is the mathematical problem of finding a knight's tour. Creating a program to find a knight's tour is a common problem given to computer science students. [3] Variations of the knight's tour problem involve chessboards of different sizes than the usual 8 × 8, as well as irregular (non-rectangular) boards.

  9. Wheat and chessboard problem - Wikipedia

    en.wikipedia.org/wiki/Wheat_and_chessboard_problem

    The wheat and chessboard problem (sometimes expressed in terms of rice grains) is a mathematical problem expressed in textual form as: If a chessboard were to have wheat placed upon each square such that one grain were placed on the first square, two on the second, four on the third, and so on (doubling the number of grains on each subsequent ...