Solving Match-3 Games with Graph Algorithms
Welcome to my technical blog series on graph algorithms. At rideOS, we use graphs and graph algorithms extensively, such as for routing of autonomous vehicles. In this series, we will be exploring how to solve Match-3 games using graph algorithms. An example of a Match-3 game is Candy Crush Saga by King, a game where the player performs swaps of adjacent candies to form contiguous lines of 3 or more candies of the same type.