When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Bridge and torch problem - Wikipedia

    en.wikipedia.org/wiki/Bridge_and_torch_problem

    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 move across a river, with some constraints.

  3. River crossing puzzle - Wikipedia

    en.wikipedia.org/wiki/River_crossing_puzzle

    The bridge and torch problem. Propositio de viro et muliere ponderantibus plaustrum. In this problem, also occurring in Propositiones ad Acuendos Juvenes, a man and a woman of equal weight, together with two children, each of half their weight, wish to cross a river using a boat which can only carry the weight of one adult. [3]

  4. Category:Logic puzzles - Wikipedia

    en.wikipedia.org/wiki/Category:Logic_puzzles

    العربية; Azərbaycanca; Башҡортса; Беларуская; Беларуская (тарашкевіца) Čeština; Ελληνικά; Español

  5. File:Bridge and torch problem.svg - Wikipedia

    en.wikipedia.org/wiki/File:Bridge_and_torch...

    Bridge and torch problem: Image title: The two solutions to the bridge and torch puzzle with the vertical axis denoting time, s the start, f the finish, T the torch and other letters as in the Wikipedia article, by CMG Lee. Width: 100%: Height: 100%

  6. Seven Bridges of Königsberg - Wikipedia

    en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg

    However, all four of the land masses in the original problem are touched by an odd number of bridges (one is touched by 5 bridges, and each of the other three is touched by 3). Since, at most, two land masses can serve as the endpoints of a walk, the proposition of a walk traversing each bridge once leads to a contradiction.

  7. Category:Combinatorial optimization - Wikipedia

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

    Bridge and torch problem; C. Cederbaum's maximum flow theorem; Change-making problem; Closure problem; Combinatorial data analysis; Combinatorial search; Continuous ...

  8. Talk:Bridge and torch problem - Wikipedia

    en.wikipedia.org/wiki/Talk:Bridge_and_torch_problem

    I have just modified one external link on Bridge and torch problem. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

  9. Three utilities problem - Wikipedia

    en.wikipedia.org/wiki/Three_utilities_problem

    When posing it in the early 20th century, Henry Dudeney wrote that it was already an old problem. It is an impossible puzzle: it is not possible to connect all nine lines without crossing. Versions of the problem on nonplanar surfaces such as a torus or Möbius strip, or that allow connections to pass through other houses or utilities, can be ...