An experimental technique for finding the shortest paths in a labyrinth is elaborated on based on chemical reaction-diffusion media. The system designed has hybrid architecture that combines an information-processing reaction-diffusion medium performing operations of high computational complexity with a digital computer carrying out supplementary operations. Two principal points are assumed as a basis for this design. They are the following: a light-sensitive Belousov-Zhabotinsky-type reagent chosen as a reaction-diffusion medium that offers the opportunity to simulate a labyrinth and spread wave evolution by its images stored in the medium; fast light-induced phase wave processes that spread through the labyrinth in seconds instead of the dozens of minutes typical of trigger waves inherent in reaction-diffusion media. Images of consecutive wave-spreading steps are stored in the memory of a digital computer. These images are used to determine the shortest paths based on the additional procedure of testing for the connectedness of labyrinth fragments.

A technique for finding the optimal path in a labyrinth based on wave processes in reaction–diffusion media is elaborated. Three principle points were assumed as a basis for this technique: (i) a hybrid architecture that combines an information‐processing reaction–diffusion medium which performs operations of high computational complexity with a digital computer carrying out supplementary image‐processing operations; (ii) light‐sensitive information‐processing media of Belousov–Zhabotinsky type that enable one to simulate the labyrinth and spreading wave evolution by their images stored in the medium and to reduce the problem to image‐processing operations; (iii) fast light‐induced phase wave processes that spread through the labyrinth in several seconds instead of hours typical for trigger waves. Modern materials for the implementation of reaction–diffusion processes and a contemporary computer‐controlled optical system were used to obtain experimental data good enough for further processing by digital means. These techniques together with the additional procedure for testing for labyrinth fragment connectedness gave the opportunity to elaborate an effective ‘hardware’ system capable of finding paths in a labyrinth. A ‘hardware’ system that would be capable of solving the problem was designed. Copyright © 1999 John Wiley & Sons, Ltd.