Skip to content
2000
Volume 5, Issue 1
  • ISSN: 1877-9468
  • E-ISSN: 1877-9476

Abstract

Maze solving and finding the shortest path or all paths in a maze are interesting and challenging computational problems. These problems are important in robotics, urban transportation, and they provide model problems of network and graph theory. In the past decades, several unconventional computing methods have been proposed to solve a maze and to find its shortest path. In this review, we review the chemical-based methods proposed in the literature. In these methods, chemistry plays an important role in phenomena that drive maze solving.

Loading

Article metrics loading...

/content/journals/cpc/10.2174/1877946805666150622155712
2015-01-01
2025-09-21
Loading full text...

Full text loading...

/content/journals/cpc/10.2174/1877946805666150622155712
Loading
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test