Abstract—Flood fill algorithm has won first places in the international micromouse competitions. To save computation time, the modified flood fill algorithm is often coded. Yet, the literature search reveals the scarcity of the quantitative details of the two algorithms. This article attempts to discuss their differences and uses Maze-solver simulator to collect and tabulate the maze-run statistics for various popular mazes. It will discuss these statistics and various aspects of the flood fill algorithm modifications.
Index Terms—Flood fill algorithm, maze simulation, micromouse competition, modified flood fill algorithm.
G. Law is with the California State University, Northridge, CA 91330, USA (e-mail: George.law@csun.edu).
[PDF]
Cite:George Law, "Quantitative Comparison of Flood Fill and Modified Flood Fill Algorithms," International Journal of Computer Theory and Engineering vol. 5, no. 3, pp. 503-508, 2013.
