Problem 44885. Bridge and Torch Problem - Probability

Created by Mehmet OZC

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:hyperlink w:docLocation=\"https://en.wikipedia.org/wiki/Bridge_and_torch_problem\"><w:r><w:t>Details of the problem ...</w:t></w:r></w:hyperlink></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>There are four people who wants to cross the bridge. But we don't know exactly who will cross the bridge in which time. However, we know that a person can cross the bridge in n1 minutes (n1 is randomly selected from the range 1:n, n is the first input). All crossing times are integers. They use</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:b/></w:rPr><w:t>Crossing Model</w:t></w:r><w:r><w:t> to cross the bridge. In each turn, they randomly select the person(s) who will cross the bridge. What is the probability that they will cross the bridge less than or equal to t minutes (t is the second input).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Let's assume first input n = 3. That means people will cross the bridge in 1, 2 or 3 minutes. all of them can cross the bridge in 1 minute or maybe all of them can cross the bridge in 3 minutes. Possibilities are listed below.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[crossingTimeList = [\n1 1 1 1\n1 1 1 2\n1 1 1 3\n1 1 2 2\n1 1 2 3\n1 1 3 3\n1 2 2 2\n1 2 2 3\n1 2 3 3\n1 3 3 3\n2 2 2 2\n2 2 2 3\n2 2 3 3\n2 3 3 3\n3 3 3 3]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>If first line is the case, all of the people will cross the bridge in 1 minute. There will be 108 cases (</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:rFonts w:cs=\"monospace\"/></w:rPr><w:t>108 = 4C2 X 2C1 X 3C2 X 3C1</w:t></w:r><w:r><w:t> ) taking 5 minutes. All of them will be less than or equal to 10 minutes (which is input 2).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>If ninth line is the case, one person will cross the bridge in one minute, one person will cross the bridge in two minutes, and others will cross the bridge in 3 minutes. 8 out of 108 ways will take less than or equal to 10 minutes.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>If last one is the case, all of them will cross the bridge in three minutes indicates that all of the journeys will take 15 minutes (longer than input2 or 10 minutes).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Result of the crossingTimeList are as follow</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[result = [\n108 108\n108 108\n060 108\n108 108\n054 108\n026 108\n108 108\n304 108\n008 108\n000 108\n108 108\n000 108\n000 108\n000 108\n000 108]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>As a result 722 out of 1620 ways will take &lt;= 10 minutes (722/1620=0.4457).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Assumption 1:</w:t></w:r><w:r><w:t> for this problem only four people will cross the bridge</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Assumption 2:</w:t></w:r><w:r><w:t> crossing times are integer</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Crossing Model:</w:t></w:r><w:r><w:t> 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

<a href = "https://en.wikipedia.org/wiki/Bridge_and_torch_problem">Details of the problem ...</a>There are four people who wants to cross the bridge. But we don't know exactly who will cross the bridge in which time. However, we know that a person can cross the bridge in n1 minutes (n1 is randomly selected from the range 1:n, n is the first input). All crossing times are integers. They use Crossing Model to cross the bridge. In each turn, they randomly select the person(s) who will cross the bridge. What is the probability that they will cross the bridge less than or equal to t minutes (t is the second input).Let's assume first input n = 3. That means people will cross the bridge in 1, 2 or 3 minutes. all of them can cross the bridge in 1 minute or maybe all of them can cross the bridge in 3 minutes. Possibilities are listed below.<pre class="language-matlab">crossingTimeList = [
1	1	1	1
1	1	1	2
1	1	1	3
1	1	2	2
1	1	2	3
1	1	3	3
1	2	2	2
1	2	2	3
1	2	3	3
1	3	3	3
2	2	2	2
2	2	2	3
2	2	3	3
2	3	3	3
3	3	3	3]
</pre>If first line is the case, all of the people will cross the bridge in 1 minute. There will be 108 cases ( <tt>108 = 4C2 X 2C1 X 3C2 X 3C1</tt> ) taking 5 minutes. All of them will be less than or equal to 10 minutes (which is input 2).If ninth line is the case, one person will cross the bridge in one minute, one person will cross the bridge in two minutes, and others will cross the bridge in 3 minutes. 8 out of 108 ways will take less than or equal to 10 minutes.If last one is the case, all of them will cross the bridge in three minutes indicates that all of the journeys will take 15 minutes (longer than input2 or 10 minutes).Result of the crossingTimeList are as follow<pre class="language-matlab">result = [
108	108
108	108
060	108
108	108
054	108
026	108
108	108
304	108
008	108
000	108
108	108
000	108
000	108
000	108
000	108]
</pre>As a result 722 out of 1620 ways will take &lt;= 10 minutes (722/1620=0.4457).Assumption 1: for this problem only four people will cross the bridgeAssumption 2: crossing times are integerCrossing Model: 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.

<https://en.wikipedia.org/wiki/Bridge_and_torch_problem Details of the problem ...>

There are four people who wants to cross the bridge. But we don't know exactly who will cross the bridge in which time. However, we know that a person can cross the bridge in n1 minutes (n1 is randomly selected from the range 1:n, n is the first input). All crossing times are integers. They use *Crossing Model* to cross the bridge. In each turn, they randomly select the person(s) who will cross the bridge. What is the probability that they will cross the bridge less than or equal to t minutes (t is the second input).

Let's assume first input n = 3. That means people will cross the bridge in 1, 2 or 3 minutes. all of them can cross the bridge in 1 minute or maybe all of them can cross the bridge in 3 minutes. Possibilities are listed below.

crossingTimeList = [
1	1	1	1
1	1	1	2
1	1	1	3
1	1	2	2
1	1	2	3
1	1	3	3
1	2	2	2
1	2	2	3
1	2	3	3
1	3	3	3
2	2	2	2
2	2	2	3
2	2	3	3
2	3	3	3
3	3	3	3]

If first line is the case, all of the people will cross the bridge in 1 minute. There will be 108 cases  ( |108 = 4C2 X 2C1 X 3C2 X 3C1| ) taking 5 minutes. All of them will be less than or equal to 10 minutes (which is input 2).

If ninth line is the case, one person will cross the bridge in one minute, one person will cross the bridge in two minutes, and others will cross the bridge in 3 minutes. 8 out of 108 ways will take less than or equal to 10 minutes.

If last one is the case, all of them will cross the bridge in three minutes indicates that all of the journeys will take 15 minutes (longer than input2 or 10 minutes).

Result of the crossingTimeList are as follow

result = [
108	108
108	108
060	108
108	108
054	108
026	108
108	108
304	108
008	108
000	108
108	108
000	108
000	108
000	108
000	108]

As a result 722 out of 1620 ways will take <= 10 minutes (722/1620=0.4457).

*Assumption 1:* for this problem only four people will cross the bridge

*Assumption 2:* crossing times are integer

*Crossing Model:* 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.

Solve

Solution Stats

21 Solutions
4 Solvers

Last Solution submitted on Oct 23, 2020

Last 200 Solutions

Problem Comments

Problem Recent Solvers4

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 44885. Bridge and Torch Problem - Probability

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers4

Suggested Problems

More from this Author72

Problem Tags

Community Treasure Hunt

Problem 44885. Bridge and Torch Problem - Probability

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers4

Suggested Problems

More from this Author72

Problem Tags

Community Treasure Hunt

Players