International Journal of Computer Theory and Engineering

Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJCTE 2013 Vol.5(3): 503-508
doi: 10.7763/IJCTE.2013.V5.738

Quantitative Comparison of Flood Fill and Modified Flood Fill Algorithms

George Law

  • California State University, Northridge, CA 91330, USA.

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.

Keywords

  • Flood fill algorithm
  • maze simulation
  • micromouse competition
  • modified flood fill algorithm
738-T012

How to Cite

Copied

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. https://doi.org/10.7763/IJCTE.2013.V5.738

Copyright & License

Copyright © 2013 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu