Shortest path finding in mazes by active and passive particles

Čejková J, Tóth R, Braun A, Branicki M, Ueyama D & Lagzi I
Choose the citation style.
Čejková, J., Tóth, R., Braun, A., Branicki, M., Ueyama, D., & Lagzi, I. (2018). Shortest path finding in mazes by active and passive particles. In A. Adamatzky (Ed.), Emergence, complexity and computation: Vol. 32. Shortest path solvers. From software to wetware (pp. 401-408). https://doi.org/10.1007/978-3-319-77510-4_15