Search results
Results From The WOW.Com Content Network
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.
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]
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%
العربية; Azərbaycanca; Башҡортса; Беларуская; Беларуская (тарашкевіца) Čeština; Ελληνικά; Español
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks. Mathematics Wikipedia:WikiProject Mathematics Template:WikiProject Mathematics ...
The problem was to devise a walk through the city that would cross each of those bridges once and only once. By way of specifying the logical task unambiguously, solutions involving either reaching an island or mainland bank other than via one of the bridges, or; accessing any bridge without crossing to its other end; are explicitly unacceptable.
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 ...
Matroid parity problem; Max-flow min-cut theorem; Maximum cut; Maximum satisfiability problem; Maximum weight matching; Metric k-center; Minimum k-cut; Minimum relevant variables in linear system; Multidimensional assignment problem