enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Fill-In (puzzle) - Wikipedia

    en.wikipedia.org/wiki/Fill-In_(puzzle)

    The solver is given a grid and a list of words. To solve the puzzle correctly, the solver must find a solution that fits all of the available words into the grid. [1] [2] [8] [9] Generally, these words are listed by number of letters, and further alphabetically. [2] [8] Many times, one word is filled in for the solver to help them begin the ...

  3. Spiral puzzle - Wikipedia

    en.wikipedia.org/wiki/Spiral_puzzle

    A spiral puzzle is a word puzzle in the form of a spiral. The puzzle is formed of a long chain of letters, which spell out a list of clued words when read in either direction. [1] The solutions to the left are entered in the boxes from 1 to 100. The responses to the right provide another set of words that must be entered from 100 to 1. [2]

  4. Word search - Wikipedia

    en.wikipedia.org/wiki/Word_search

    A word search. A word search, word find, word seek, word sleuth or mystery word puzzle is a word game that consists of the letters of words placed in a grid, which usually has a rectangular or square shape. The objective of this puzzle is to find and mark all the words hidden inside the box. The words may be placed horizontally, vertically, or ...

  5. List of impossible puzzles - Wikipedia

    en.wikipedia.org/wiki/List_of_impossible_puzzles

    It is impossible to solve in half of the starting positions. [1] Five room puzzle – Cross each wall of a diagram exactly once with a continuous line. [2] MU puzzle – Transform the string MI to MU according to a set of rules. [3] Mutilated chessboard problem – Place 31 dominoes of size 2×1 on a chessboard with two opposite corners removed ...

  6. Combinatorial search - Wikipedia

    en.wikipedia.org/wiki/Combinatorial_search

    Classic combinatorial search problems include solving the eight queens puzzle or evaluating moves in games with a large game tree, such as reversi or chess. A study of computational complexity theory helps to motivate combinatorial search. Combinatorial search algorithms are typically concerned with problems that are NP-hard. Such problems are ...

  7. The Hardest Logic Puzzle Ever - Wikipedia

    en.wikipedia.org/wiki/The_Hardest_Logic_Puzzle_Ever

    Allowing the "exploding head" case gives yet another solution of the puzzle and introduces the possibility of solving the puzzle (modified and original) in just two questions rather than three. In support of a two-question solution to the puzzle, the authors solve a similar simpler puzzle using just two questions.

  8. Maze: Solve the World's Most Challenging Puzzle - Wikipedia

    en.wikipedia.org/wiki/MAZE:_Solve_the_World's...

    Maze: Solve the World's Most Challenging Puzzle (1985, Henry Holt and Company) is a puzzle book written and illustrated by Christopher Manson. The book was originally published as part of a contest to win $10,000. Unlike other puzzle books, each page is involved in solving the book's riddle.

  9. Hangman (game) - Wikipedia

    en.wikipedia.org/wiki/Hangman_(game)

    Example game in which the letters A and N but not the whole word HANGMAN were guessed – incorrect guesses are noted at the bottom Hangman is a guessing game for two or more players. One player thinks of a word , phrase , or sentence and the other(s) tries to guess it by suggesting letters or numbers within a certain number of guesses.