| Summary: | Experimental studies have shown that fungi use a natural program for searching the space available in micro-confined networks, e.g., mazes. This natural program, which comprises two subroutines, i.e., collision-induced branching and directional memory, has been shown to be efficient compared with the suppressing one, or both subroutines. The present contribution compares the performance of the fungal natural program against several standard space searching algorithms. It was found that the fungal natural algorithm consistently outperforms Depth-First-Search (DFS) algorithm, and although it is inferior to informed algorithms, such as A*, this under-performance does not increase importantly with the increase of the size of the maze. These findings encourage a systematic effort to harvest the natural space searching algorithms used by microorganisms, which, if efficient, can be reverse-engineered for graph and tree search strategies.
|
|---|
