« first day (4903 days earlier)      last day (432 days later) » 

14:28
2
Q: What is this FPS in Radiation Hazard's "Block Mesa 64" video?

Stevoisiak18 seconds into Radiation Hazard's video Block Mesa 64, he mentions Super Mario 64 and Half Life while jokingly showing images of two different games. The left image obviously is from Donkey Kong 64, but what FPS game is the image on the right from?

 
2 hours later…
16:19
I'm quite stumped on today. I get I should use Dijkstra, but I'm not sure how to account for movement restrictions.
16:38
I got it working with a modified A* that tracks the last 3 directions moved for each point in the frontier
16:56
@murgatroid99 I haven't used A* since university, but it's an extension on Dijkstra, right?
My problem with just tracking the last 3 directions would be a graph like this:
11111
29991
11111
Shortest path with the restriction would be to start by going down (aka go through the 2) so that you avoid going through a 9. However, if you just followed Dijkstra until you hit your 3 movement limit, you'd miss that path and take a 9.
If you start by going down, how do you avoid going to the right 4 times and avoid going through a 9?
Oh right, derp
To be more specific, my frontier tracks (current point, current path length, last 3 directions)
A* means that you add a heuristic for distance to the end, so you sort the points by current path length + heuristic instead of just current path length
17:34
I kept track of x, y, direction, and number of times moved in that direction, but other than that I did the same
Also I got lazy and just used a sorted heap library rather than implementing my own
17:46
Haven't started yet, but I'm probably just going to do the same and use current cost plus Manhattan distance to end in a priority queue
 
2 hours later…
19:54
@Ronan I used Python's queues.PriorityQueue

« first day (4903 days earlier)      last day (432 days later) »