Previous experiments have shown that fungi use an efficient natural algorithm for searching the space available for their growth in micro-confined networks, e.g., mazes. This natural “master” algorithm, which comprises two “slave” sub-algorithms, i.e., collision-induced branching and directional memory, has been shown to be more efficient than alternatives, with one, or the other, or both sub-algorithms turned off. In contrast, the present contribution compares the performance of the fungal natural algorithm against several standard artificial homologues. It was found that the space-searching fungal algorithm consistently outperforms uninformed algorithms, such as Depth-First-Search (DFS). Furthermore, while the natural algorithm is inferior to informed ones, such as A*, this under-performance does not importantly increase with the increase of the size of the maze. These findings suggest that a systematic effort of harvesting the natural space searching algorithms used by microorganisms is warranted and possibly overdue. These natural algorithms, if efficient, can be reverse-engineered for graph and tree search strategies.
Optimal Fungal Space Searching Algorithms https://www.embs.org/tnb/wp-content/uploads/sites/16/2016/12/Dan-Main-Box.png 780 435 Transactions on NanoBioscience (TNB) //www.embs.org/tnb/wp-content/uploads/sites/16/2022/06/ieee-tnb-logo2x.png