Tag Archives: markov chains

Virtual Hyenas, Markov Chains, and Random Knights

Welcome to this week’s Math Munch!

It’s amazing how a small step can lead to a chain reaction of adventure.

Arend Hintze

Arend Hintze

Recently a reader named Nico left a comment on the Math Munch post where I shared the game Loops of Zen. He asked why the game has that name. Curious, I looked up Dr. Arend Hintze, whose name appears on the game’s title page. This led me to Arend’s page at the Adami Lab at Michigan State University. Arend studies how complex systems—especially biological systems—evolve over time.

Here is a video of one of Arend’s simulations. The black and white square is a zebra. The yellow ones are lions, the red ones are hyenas, and guess who’s hungry?

Arend’s description of the simulation is here. The cooperative behavior in the video—two hyenas working together to scare away a lion—wasn’t programmed into the simulation. It emerged out of many iterations of systems called Markov Brains—developed by Arend—that are based upon mathematical structures called Markov chains. More on those in a bit.

You can read more about how Arend thinks about his multidisciplinary work on biological systems here. Also, it turns out that Arend has made many more games besides Loops of Zen. Here’s Blobs of Zen, and Ink of Zen is coming out this month! Another that caught my eye is Curve, which reminds me of some of my favorite puzzle games. Curve is still in development; here’s hoping we’ll be able to play it soon.

Arend has agreed to do an interview with Math Munch, so share your questions about his work, his games, and his life below!

Eric Czekner

Eric Czekner

Arend’s simulations rely on Markov chains to model animal behavior. So what’s a Markov chain? It’s closely related to the idea of a random walk. Check out this video by digital artist, musician, and Pure Data enthusiast Eric Czekner. In the video, Eric gives an overview of what Markov chains are all about and shows how he uses them to create pieces of music.

On this page, Eric describes how he got started using Markov chains to make music, along with several of his compositions. It’s fascinating how he captures the feel of a song by creating a mathematical system that “generates new patterns based on existing probabilities.”

Now there’s a big idea: exploring something randomly can capture structures that might be hard to perceive otherwise. Here’s one last variation on the Markov chain theme that involves a pure math question. This blog post ponders the question: what happens when a knight takes a random walk—or random trot?—on a chessboard? It includes some colorful images of chessboards along the way.

How likely it is that a knight lands on each square after five moves, starting from b1.

How likely it is that a knight lands on each square after five moves, starting from b1.

The probabili

How likely it is that a knight lands on each square after 200 moves, starting from b1.

The blogger—Leonid Kovalev—shows in his analysis what happens in the long run: the number of times a knight will visit a square will be proportional to the number of moves that lead to that square. For instance, since only two knight moves can reach a corner square while eight knight moves can reach a central square, it’s four times as likely that a knight will finish on a central square after a long, long journey than on a corner square. This idea works because moving a knight around a chessboard is a “reversible Markov chain”—any path that a knight can trace can also be untraced. The author also wrote a follow-up post about random queens.

It’s amazing the things you can find by chaining together ideas or by taking a random walk. Thanks for the inspiration for this post, Nico. Keep those comments and questions coming, everyone—we love hearing from you.

Bon appetit!