enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. 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.

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

  4. Longest uncrossed knight's path - Wikipedia

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

    The longest uncrossed (or nonintersecting) knight's path is a mathematical problem involving a knight on the standard 8×8 chessboard or, more generally, on a square n×n board. The problem is to find the longest path the knight can take on the given board, such that the path does not intersect itself.

  5. Knight's graph - Wikipedia

    en.wikipedia.org/wiki/Knight's_graph

    In graph theory, a knight's graph, or a knight's tour graph, is a graph that represents all legal moves of the knight chess piece on a chessboard.Each vertex of this graph represents a square of the chessboard, and each edge connects two squares that are a knight's move apart from each other.

  6. Chess puzzle - Wikipedia

    en.wikipedia.org/wiki/Chess_puzzle

    A chess puzzle is a puzzle in which knowledge of the pieces and rules of chess is used to logically solve a chess-related problem. The history of chess puzzles reaches back to the Middle Ages and has since evolved. Usually the goal is to find the single best, ideally aesthetic move or a series of single best moves in a chess position, that was ...

  7. Glossary of chess problems - Wikipedia

    en.wikipedia.org/wiki/Glossary_of_chess_problems

    A chess problem theme in which the solution includes pawn promotions to all possible pieces (in orthodox chess, to bishop, knight, rook and queen; in fairy chess, possibly to fairy pieces). anti-Bristol The interference of one black piece by another like-moving one on the same line (if the pieces are on different lines, it is a Holzhausen).

  8. Games on AOL.com: Free online games, chat with others in real ...

    www.aol.com/games/play/ensenasoft/chess-knight

    Discover the best free online games at AOL.com - Play board, card, casino, puzzle and many more online games while chatting with others in real-time.

  9. Knight (chess) - Wikipedia

    en.wikipedia.org/wiki/Knight_(chess)

    The knight (♘, ♞) is a piece in the game of chess, represented by a horse's head and neck. It moves two squares vertically and one square horizontally, or two squares horizontally and one square vertically, jumping over other pieces.