Heuristic-modified region filling algorithms for A-B connection searching problem

This paper presents optimized connection searching method based on region filling algorithms. The proposed method is optimized using the heuristic and is intended for maze-solving. In specific cases, the proposed algorithm performs better than variants which do not use heuristic and it depends on the maze structure and position of the starting and ending pixel.