Skip to main content
Log in

Orientation in a maze

  • Automata
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Consideration is given to the problem of maze routing: compilation of a route that delivers us from an arbitrary point to a given one. A class of mazes subject to routing (namely, a class of mazes for which the problem of routing can be solved) is described.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Shannon, C., A Report about the Machine Solving the Maze Problem, in Raboty po teorii informatsii i kibernetike (The Works on the Theory of Information and Cybernetics), Moscow: Inostrannaya Literatura, 1963.

    Google Scholar 

  2. Kudryavtsev, V.B., Ushchumlich, Sh., and Kilibarda, G., The Bahavior of Automata in Mazes, Diskret. Mat., 1992, vol. 4, no. 3, pp. 3–28.

    MathSciNet  Google Scholar 

  3. Bhatt, S., Even, S., Greenberg, D., and Tayar, R., Traversing Directed Eulerian Mazes, J. Graph Algorithms App., 2002, vol. 6, no. 2, pp. 157–173 (http://www.cs.brown.edu/publications/jgaa/accepted/2002/Bhatt+2002.6.2.pdf).

    MATH  MathSciNet  Google Scholar 

  4. Lallement, G., Semigroups and Combinatorial Applications, New York: Wiley, 1979. Translated under the title Polugruppy i kombinatornye prilozheniya, Moscow: Mir, 1985, pp. 251–263.

    MATH  Google Scholar 

  5. Mirkin, B.G., Problema gruppovogo vybora (The Cluster Sampling Problem), Moscow: Nauka, 1974, pp. 93–95.

    MATH  Google Scholar 

  6. Aizerman, M.A., Dynamic Aspects of the Voting Theory, Avtom. Telemekh., 1981, no. 12, pp. 103–118.

  7. Chebotarev, P.Yu., Borzenko, V.I., Lezina, Z.M., et al., Cooperation and Egoism as a Voting Strategy in Stochastic Medium, Tret’ya mezhdunarodnaya konferentsiya po problemam upravleniya. Plenarnye doklady i izbrannye trudy (Third Int. Conf. of Control Problems, Plenary Reports and Selected Works), Moscow: Inst. Probl. Upravlen., 2006, pp. 304–311.

    Google Scholar 

  8. Algebraic Theory of Machines, Languages, and Semigroups, Arbib, M.A., Ed., New York: Wiley, 1979. Translated under the title Algebraicheskaya teoriya avtomatov, yazykov i polugrupp, Moscow: Statistika, 1975.

    Google Scholar 

  9. Aho, A., Hopfkroft, J., and Ulman, J., Data Structures and Algorithms, New York: Addison-Wesley, 2000. Translated under the title Postroenie i analiz vychislitel’nykh algoritmov, Moscow: Mir, 1979.

    Google Scholar 

  10. Crochemore, M. and Rytter, W., Jewels of Stringology, Singapore: World Scientific, 2002.

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © A.V. Babichev, 2008, published in Avtomatika i Telemekhanika, 2008, No. 2, pp. 135–145.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Babichev, A.V. Orientation in a maze. Autom Remote Control 69, 299–309 (2008). https://doi.org/10.1134/S0005117908020100

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117908020100

PACS number

Navigation