Ticket to Ride and Dijkstra’s algorithm

Abstract: In this post we look at how Dijkstra’s algorithm can be used to find the shortest path between two cities in Ticket to Ride. This can be used to find the optimal route for Destination Tickets, an important aspect of gameplay in Ticket to Ride. Ticket to Ride is a modern day classic. InContinue reading “Ticket to Ride and Dijkstra’s algorithm”