Published in


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.

The game board in Candy Crush Saga (source).




Accelerating the safe, global roll-out of human-driven and autonomously-controlled transportation

Recommended from Medium

Day 10: All You Need Is A Good Init

Masking an area in a video in OpenCV in Python— Harry Potter Invisible Cloak example

What you’ll learn from fast ai (v2 part 2) Lesson 8

The Math Behind Machine Learning

Edge TPU: Hands-On with Google’s Coral USB Accelerator

Number Plate Recognition using TensorFlow and Agora.io

Analyzing Hindu Verses with NLP

A Modern Approach to Versioning Large Datasets for Machine learning

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Allison Liemhetcharat

Allison Liemhetcharat

Proud mom, roboticist, software engineer.

More from Medium

First Issue of 《Journal of Machine Learning》 is Online

Making an AI for a coding interview question

Combat the Great Resignation Using Machine Learning (Without Code!)

Course Review: Natural Language Processing in TensorFlow