Facilitating Hard-to-Defeat Car AI Using Flood-Fill Algorithm

Abstract

The most vital element in making a non-playable car AI in racing games is finding the shortest path between two locations (the start and the finish lines) by making an efficient algorithm for the car to follow it. Usually, both the lines are predetermined for each race in most of the popular games. However , there has not been any game where the player gets the option to select those. Hence, in this work, an effort will be given to make sure that the player can choose the start line (source) and the finish line (destination) while flood-fill algorithm calculates the shortest path for the car at a shortest possible time and helps the car to follow it fast enough. The completed game has been tested and from the user review, it seems to be quite difficult to defeat the opponent.