A few years ago, Yandex organized a competition called "Robot Courier" and offered an attractive prize: a ticket to a closed self-driving meeting of professionals. The competition is similar to a game in which participants are tasked with finding the best route on a map and optimizing deliveries using robot couriers.
As I dug deeper into the topic, I discovered that even though the route finding problem has been solved, it's still of interest to the professional game development community. Especially beneficial for AAA games with massive maps.
Furthermore, the competition requirements are designed so that program output can be easily evaluated by the competition's test system. As a result, there is little emphasis on visualization.
I found exploring this area and developing a graph algorithm that uses well-known graph algorithms to search on a grid map.