Pathfinding algorithms: Dijkstra’s and Breadth-first search

The photos below show Simon playing with Breadth-first search and Dijkstra’s algorithms to find the most efficient path from S to E on a set of graphs. The two more … Continue reading Pathfinding algorithms: Dijkstra’s and Breadth-first search

Vladimir Krasnoukhov at MathsJam Antwerp!

When we arrived at the MathsJam last Tuesday, we heard a couple of people speak Russian. One of them turned out to be a well known Russian puzzle inventor Vladimir … Continue reading Vladimir Krasnoukhov at MathsJam Antwerp!

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

MEL Chemistry Experiments: Making Batteries

We did two more experiments a couple days ago: Liquid Wires (creating a simple circuit using graphite and liquid glass, a sodium silicate solution) and making our own Zinc-Carbon Battery, … Continue reading MEL Chemistry Experiments: Making Batteries