Geodesic
Solving puzzles by O. Ore's method
Daghestan Electronic Mathematical Reports, Tome 13 (2020), pp. 22-30

Voir la notice de l'article provenant de la source Math-Net.Ru

In some cases, the formalisation of the puzzle in terms of graph theory allows us to solve the puzzle by finding a path in a connected acyclic digraph. We follow the approach taken in Ore's book on graph theory. In the present paper we demonstrate the approach on problems of different origins. In each case, the problem is restated in terms of a connected acyclic digraph whose nodes are certain states and whose directed arcs are transitions between states; then it is shown how to reduce the problem to finding a directed path between the nodes of the constructed digraph.
Keywords: algorithm, arc, node, oriented graph, path. 
@article{DEMR_2020_13_a1,
     author = {A. M. Magomedov and S. Lawrencenko},
     title = {Solving puzzles by {O.} {Ore's} method},
     journal = {Daghestan Electronic Mathematical Reports},
     pages = {22--30},
     publisher = {mathdoc},
     volume = {13},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DEMR_2020_13_a1/}
}
TY  - JOUR
AU  - A. M. Magomedov
AU  - S. Lawrencenko
TI  - Solving puzzles by O. Ore's method
JO  - Daghestan Electronic Mathematical Reports
PY  - 2020
SP  - 22
EP  - 30
VL  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DEMR_2020_13_a1/
LA  - ru
ID  - DEMR_2020_13_a1
ER  - 
%0 Journal Article
%A A. M. Magomedov
%A S. Lawrencenko
%T Solving puzzles by O. Ore's method
%J Daghestan Electronic Mathematical Reports
%D 2020
%P 22-30
%V 13
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DEMR_2020_13_a1/
%G ru
%F DEMR_2020_13_a1
A. M. Magomedov; S. Lawrencenko. Solving puzzles by O. Ore's method. Daghestan Electronic Mathematical Reports, Tome 13 (2020), pp. 22-30. http://geodesic.mathdoc.fr/item/DEMR_2020_13_a1/