Construction and Enumeration of Circuits Capable of Guiding a Miniature Vehicle

Open access


In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding polygons (whose explicit enumeration has not yet been resolved for an arbitrary number of squares) yet there are numerous differences, notably the fact that the geometric constraints are different than those of self-avoiding polygons. We present the methodology allowing the construction and enumeration of all of the possible tracks containing a given number of pieces. For small numbers of pieces, the exact enumeration will be treated. For greater numbers of pieces, only an estimation will be offered. In the latter case, a randomly construction of circuits is also given. We will give some routes for generalizations for similar problems.

[1] Bastien, J. “Circuit apte à guider un véhicule miniature”, Patent FR2990627, University Lyon I, May 15, 2012.

[2] Bastien, J. “Circuit suitable for guiding a miniature véhicle [Circuit apte à guider un véhicule miniature]”, Patent WO2013171170, University Lyon I, May 13, 2013.

[3] Bastien, J. Comment concevoir un circuit de train miniature qui se reboucle toujours bien?, Transparents présentés lors du Forum des mathématiques 2015 à l’Académie des sciences, belles-lettres et arts de Lyon, 73 pages, 2015.

[4] Bastien, J. Comment concevoir un circuit de train miniature qui se reboucle toujours bien ?-Deux questions d’algèbre et de dénombrement, Transparents présentés au “séminaire détente” de la Maison des Mathématiques et de l’Informatique, Lyon, 80 pages, 2015.

[5] Clisby, N., Jensen, I. “A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice”, in J. Phys. A 45.11, pages 115202 and 15, doi:

[6] Farin, G., Hoschek, J., Kim, M.-S. (editors). Handbook of computer aided geometric design, North-Holland, Amsterdam, pages xxviii+820, 2002.

[7] Guttmann, A. J. “Self-Avoiding Walks and Polygons-An Overview”, arXiv:1212.3448, 2012.

[8] Guttmann, A. J. “Self-Avoiding Walks and Polygons-An Overview”, in Asia Pacific Mathematics Newsletter 2.4, 2012.

[9] Holweck, F., Martin, J.-N. Géométries pour l’ingénieur (french) [Geometries for the engineer], Paris, Ellipses, 2013.

[10] Jensen, I. “A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice” in J. Phys. A 36.21, 5731-5745, doi:

[11] Jensen, I. “Enumeration of self-avoiding walks on the square lattice”, in J. Phys. A 37.21, 5503-5524. doi:

[12] Jensen, I. “Improved lower bounds on the connective constants for two-dimensional self-avoiding walks”, in J. Phys. A 37.48, 11521-11529, doi:

[13] Jensen, I., Guttmann, A. J. “Self-avoiding polygons on the square lattice”, in J. Phys. A 32.26, 4867-4876, doi:

[14] Lebossé, C. Hémery, C. Géométrie, Classe de Mathématiques (Programmes de 1945) (French) [Geometry. Classe de Mathématiques (1945 programs)], Paris, Jacques Gabay, 1997.

[15] Madras, N., Slade, G. The self-avoiding walk. Probability and its Applications, Birkh¨auser Boston, Inc., pages xiv+425, Boston, MA, 1993.

[16] D. Perrin. “Les courbes de Bézier (French) [Bézier curves]”, Notes for preparing the CAPES mathematics.

[17] G. Slade. “The self-avoiding walk: a brief survey”, in Surveys in stochastic processes. EMS Ser. Congr. Rep. Eur. Math. Soc., 181-199, doi:

Journal Information

Target Group

researchers in the fields of games and puzzles, problems, mathmagic, mathematics and arts, math and fun with algorithms


All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 77 77 33
PDF Downloads 25 25 11