Search in a maze

S. Gal; E. J. Anderson

doi:10.1017/S0269964800001625

Search in a maze

S. Gal, E. J. Anderson

Research output: Contribution to journal › Article › peer-review

Abstract

Suppose that you find yourself trapped in a maze about which you know nothing except that it has an exit point. We present an optimal strategy that will lead you to the exit point in minimum expected time. This strategy ensures that the expected total length of the arcs you traverse will not exceed the sum of the lengths of the arcs in the maze.

Original language	English
Pages (from-to)	311-318
Number of pages	8
Journal	Probability in the Engineering and Informational Sciences
Volume	4
Issue number	3
DOIs	https://doi.org/10.1017/S0269964800001625
State	Published - 1990
Externally published	Yes

ASJC Scopus subject areas

Statistics and Probability
Statistics, Probability and Uncertainty
Management Science and Operations Research
Industrial and Manufacturing Engineering

Access to Document

10.1017/S0269964800001625

Cite this

@article{1716f13a822542b392d5b79178a8189c,

title = "Search in a maze",

abstract = "Suppose that you find yourself trapped in a maze about which you know nothing except that it has an exit point. We present an optimal strategy that will lead you to the exit point in minimum expected time. This strategy ensures that the expected total length of the arcs you traverse will not exceed the sum of the lengths of the arcs in the maze.",

author = "S. Gal and Anderson, {E. J.}",

year = "1990",

doi = "10.1017/S0269964800001625",

language = "English",

volume = "4",

pages = "311--318",

journal = "Probability in the Engineering and Informational Sciences",

issn = "0269-9648",

publisher = "Cambridge University Press",

number = "3",

}

TY - JOUR

T1 - Search in a maze

AU - Gal, S.

AU - Anderson, E. J.

PY - 1990

Y1 - 1990

N2 - Suppose that you find yourself trapped in a maze about which you know nothing except that it has an exit point. We present an optimal strategy that will lead you to the exit point in minimum expected time. This strategy ensures that the expected total length of the arcs you traverse will not exceed the sum of the lengths of the arcs in the maze.

AB - Suppose that you find yourself trapped in a maze about which you know nothing except that it has an exit point. We present an optimal strategy that will lead you to the exit point in minimum expected time. This strategy ensures that the expected total length of the arcs you traverse will not exceed the sum of the lengths of the arcs in the maze.

UR - http://www.scopus.com/inward/record.url?scp=84974074900&partnerID=8YFLogxK

U2 - 10.1017/S0269964800001625

DO - 10.1017/S0269964800001625

M3 - Article

AN - SCOPUS:84974074900

SN - 0269-9648

VL - 4

SP - 311

EP - 318

JO - Probability in the Engineering and Informational Sciences

JF - Probability in the Engineering and Informational Sciences

IS - 3

ER -

Search in a maze

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this