When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Traverse: Starlight & Prairie - Wikipedia

    en.wikipedia.org/wiki/Traverse:_Starlight_&_Prairie

    Traverse: Starlight & Prairie (トラバース スターライト&プレーリー) is a Japanese-only non-linear, turn-based role-playing video game developed by Pandora Box and published by Banpresto in 1996. It is a sequel to Soul & Sword, with a few returning characters.

  3. Wolf, goat and cabbage problem - Wikipedia

    en.wikipedia.org/wiki/Wolf,_goat_and_cabbage_problem

    In the earliest known occurrence of this problem, in the medieval manuscript Propositiones ad Acuendos Juvenes, the three objects are a wolf, a goat, and a cabbage, but other cosmetic variations of the puzzle also exist, such as: wolf, sheep, and cabbage; [4] [2], p. 26 fox, chicken, and grain; [5] fox, goose and corn; [6] and panther, pig, and ...

  4. River crossing puzzle - Wikipedia

    en.wikipedia.org/wiki/River_crossing_puzzle

    Well-known river-crossing puzzles include: The fox, goose, and bag of beans puzzle, in which a farmer must transport a fox, goose and bag of beans from one side of a river to another using a boat which can only hold one item in addition to the farmer, subject to the constraints that the fox cannot be left alone with the goose, and the goose cannot be left alone with the beans.

  5. Bridge and torch problem - Wikipedia

    en.wikipedia.org/wiki/Bridge_and_torch_problem

    [1] The puzzle is known to have appeared as early as 1981, in the book Super Strategies For Puzzles and Games. In this version of the puzzle, A, B, C and D take 5, 10, 20, and 25 minutes, respectively, to cross, and the time limit is 60 minutes. [6] [7] In all these variations, the structure and solution of the puzzle remain the same.

  6. Hoffman's packing puzzle - Wikipedia

    en.wikipedia.org/wiki/Hoffman's_packing_puzzle

    By a result of Raphael M. Robinson this is again solvable whenever d = d 1 × d 2 for two numbers d 1 and d 2 such that the d 1 - and d 2-dimensional cases are themselves solvable. For instance, according to this result, it is solvable for dimensions 4, 6, 8, 9, and other 3-smooth numbers. In all dimensions, the inequality of arithmetic and ...

  7. Missionaries and cannibals problem - Wikipedia

    en.wikipedia.org/wiki/Missionaries_and_cannibals...

    To fully solve the problem, a simple tree is formed with the initial state as the root. The five possible actions ( 1,0,1 , 2,0,1 , 0,1,1 , 0,2,1 , and 1,1,1 ) are then subtracted from the initial state, with the result forming children nodes of the root. Any node that has more cannibals than missionaries on either bank is in an invalid state ...

  8. Template:River item box - Wikipedia

    en.wikipedia.org/wiki/Template:River_item_box

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more

  9. Water pouring puzzle - Wikipedia

    en.wikipedia.org/wiki/Water_pouring_puzzle

    The standard puzzle of this kind works with three jugs of capacity 8, 5 and 3 liters. These are initially filled with 8, 0 and 0 liters. In the goal state they should be filled with 4, 4 and 0 liters.