Know-Legal Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Missionaries and cannibals problem - Wikipedia

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

    The missionaries and cannibals problem, and the closely related jealous husbands problem, are classic river-crossing logic puzzles. [1] The missionaries and cannibals problem is a well-known toy problem in artificial intelligence, where it was used by Saul Amarel as an example of problem representation. [2] [3]

  3. Wolf, goat and cabbage problem - Wikipedia

    en.wikipedia.org/wiki/Wolf,_goat_and_cabbage_problem

    The depiction by Ōkyo shows the tiger family crossing a river, with the mother carrying one cub across the river at a time. This depicts a puzzle equivalent to the puzzle of the wolf, goat, and cabbage, asking how the mother can do this without leaving the leopard cub alone with any of the other tiger cubs. The same variation of the puzzle has ...

  4. River crossing puzzle - Wikipedia

    en.wikipedia.org/wiki/River_crossing_puzzle

    River crossing puzzle. A river crossing puzzle is a type of puzzle in which the object is to carry items from one river bank to another, usually in the fewest trips. The difficulty of the puzzle may arise from restrictions on which or how many items can be transported at the same time, or which or how many items may be safely left together. [1]

  5. Bridge and torch problem - Wikipedia

    en.wikipedia.org/wiki/Bridge_and_torch_problem

    The two solutions with the vertical axis denoting time, s the start, f the finish and T the torch. The bridge and torch problem (also known as The Midnight Train [1] and Dangerous crossing [2]) is a logic puzzle that deals with four people, a bridge and a torch. It is in the category of river crossing puzzles, where a number of objects must ...

  6. List of PSPACE-complete problems - Wikipedia

    en.wikipedia.org/wiki/List_of_PSPACE-complete...

    s-t reachability problem for succinct graphs. This is essentially the same as the simplest plan existence problem in automated planning and scheduling. planarity of succinct graphs. acyclicity of succinct graphs. connectedness of succinct graphs. existence of Eulerian paths in a succinct graph.

  7. Seven Bridges of Königsberg - Wikipedia

    en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg

    Map of Königsberg in Euler's time showing the actual layout of the seven bridges, highlighting the river Pregel and the bridges. The Seven Bridges of Königsberg is a historically notable problem in mathematics. Its negative resolution by Leonhard Euler in 1736 [1] laid the foundations of graph theory and prefigured the idea of topology.

  8. Propositiones ad Acuendos Juvenes - Wikipedia

    en.wikipedia.org/wiki/Propositiones_ad_Acuendos...

    The medieval Latin manuscript Propositiones ad Acuendos Juvenes (English: Problems to Sharpen the Young) is one of the earliest known collections of recreational mathematics problems. [1] The oldest known copy of the manuscript dates from the late 9th century. The text is attributed to Alcuin of York (died 804.)

  9. Is Washington Crossing Bridge doomed? When we'll likely ... - AOL

    www.aol.com/washington-crossing-bridge-doomed...

    The bridge’s last inspection in 2022 rated it “fair.”. In 2023, it carried 2,609,703 vehicles across the Delaware River. That same year, commission bridge monitors turned away more than ...