Numerical Simulation of Maze Solving Using Chemotactic Particles
Ádám Leelőssy, Gábor Holló, Kohta Suzuno, Daishin Ueyama and István Lagzi
Unconventional computational methods provide alternative ways to solve numerous mathematical and computational problems compared to conventional approaches. Maze solving and finding the shortest path is one of the most challenging problems in this field. In the past few decades, several chemical, physical, and other techniques have been developed. Here we investigated the maze solving behavior of chemotactic particles in two geometrical orientations of channels, in a simple rectangular domain and in a complex maze, to show that both the fluctuation of Brownian particle motion and the geometry of the maze can play an important role in maze solving. We systematically studied the effect of stochastic (Brownian motion) and deterministic (chemotactic motion) parts on the characteristic of particle motion and maze solving.
Keywords: Maze solving; chemotaxis; directional motion; shortest path; Brownian motion; self-propelled particles