Quantum computing has the promise of speeding up our solving of NP-hard problems. Here, we give a brief explanation of modern quantum annealing technology and describe how we created a solver for the Tiling Problem using quantum annealing.

Whether it gives you flashbacks of an old-school 80s arcade, or you just played it on your phone a last night, it’s a pretty universal truth that Tetris, the game we all know and love, is a classic. Alongside games like Blokus and Genius Star, the thematic goal of these “tiling puzzles” is to fit as many of the provided pieces as you possibly can onto a grid. This involves a few things: choosing where to place the piece, what orientation to place it, and, in some games, whether it is worth it to even place that piece at all.

Sage Simhon

MIT EECS student

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