• Sign Up
  • Archive

Breadth First Search Illustrated

Source: https://youtu.be/akZ8JJ4gGLs

Our last one for today is only loosely related, but you will like it. There are several different algorithms to solve a maze. One of them is breadth-first-search.

Matt Henderson a math wiz and google AI researcher implemented a version in Mathematica which is not only beautiful in itself, it creates a graphical output, that will a’maze you. 🥳

Brady Haran - to most known as numberphile - interviewed Matt, and the result can be seen in numberphile’s latest video. Don’t miss it.

I would love to see an assembly implementation on an 8-bit machine!

Share the signal:

Read the full newsletter issue #15 of 8bitnews.io: The TRS-80 Is Still Alive

More from #15

Don't want to miss updates like that? Subscribe below and receive regular content that we only share with our subscribers.

Don't Miss

Sign up for our retro & computing magazine and get content like that regularly. Relevant. Up to date. Free.

We send our subscribers one update per week. Retro & computing topics well curated by a team who love machines of the 70s, 80s and 90s as much as you do.

  • Terms
  • Privacy
  • Imprint