Experimenting with random walks in Wolfram Mathematica

Simon’s code is published online at: https://www.wolframcloud.com/objects/monajune0/Published/Random_walk_distribution.nbhttps://www.wolframcloud.com/objects/monajune0/Published/Random_walk_distribution2D.nb “If I take many random walks and see what the endpoints of those random walks are, what I’ll find is a Gaussian distribution!” … Continue reading Experimenting with random walks in Wolfram Mathematica

Dijkstra’s pathfinding algorithm

“I have first built a maze, then I turned it into a graph and applied Dijkstra’s pathfinding algorithm!” Simon learned this from the Computerphile channel. He later also attempted to … Continue reading Dijkstra’s pathfinding algorithm

More Sorting Algorithms!

An update to Simon’s new project: a series of video tutorials on sorting algorithms! See the full playlist here. Finally, parts 6 and 7 of Simon’s exciting series of video … Continue reading More Sorting Algorithms!

Simon creates a playlist with Sorting Algorithms tutorials in Python

Simon has started a huge new project: a series of video tutorials about sorting algorithms. In the videos, he codes on his RaspberryPi, but here is the link to the … Continue reading Simon creates a playlist with Sorting Algorithms tutorials in Python

Fun with Brilliant’s Computer Courses

“Mom, how long would it take a supercomputer running at 10^15 additions per second to calculate the 1000th Fibonacci number?” Simon has learned this problem from the new course he … Continue reading Fun with Brilliant’s Computer Courses

Multiplicative Persistence in Wolfram Mathematica

Simon has tried Matt Parker’s multiplicative persistence challenge on Numberphile: by multiplying all the digits in a large number, looking for the number of steps it takes to bring that … Continue reading Multiplicative Persistence in Wolfram Mathematica