Crafting MazesIn our previous post, we delved into problems of pathfinding in graphs, which are inherently connected to solving mazes. When I set out to create a maze map for the Wall-E project, I initially expected to find a quick and easy way to accomplish this ...Sep 24, 2023 · 6 min readoptiklab.hashnode.dev
Exploring well-known path finding algorithms with SFML graphics libraryIntro As someone who is not a professional game developer, I have always been curious about different concepts and enjoy exploring topics that are not directly related to my daily routine. Throughout my career, I have often found myself working on sm...Sep 17, 2023 · 12 min readoptiklab.hashnode.dev
Universal implementation of BFS, DFS, Dijkstra and A-Star algorithmsIt turns out that well-known algorithms like BFS, DFS, Dijkstra, and A-Star are essentially variations of the same algorithm. In other words, it is possible to implement a universal data structure that can switch between these algorithms without requ...Sep 16, 2023 · 12 min readoptiklab.hashnode.dev
