annotate template.rb @ 39:0e17e4bd97a9 default tip

Rewrite as four-dimensional route finding The grid isn't just a 2D grid. The constraints make it 4D: * X * Y * Last direction * Number of steps in that direction By tracking all four dimensions, we can find the shortest route for _all_ combinations of the constraint. Previously, we were dropping routes that were currently longer but ended up shorter because they could take subsequent steps that other routes couldn't.
author IBBoard <dev@ibboard.co.uk>
date Sun, 22 Sep 2024 11:30:53 +0100
parents 51e5f26dc81e
children
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
8
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
1 #! /usr/bin/env ruby
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
2
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
3 if ARGV.length != 1
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
4 abort("Incorrect arguments - needs input file")
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
5 elsif not File.exist? (ARGV[0])
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
6 abort("File #{ARGV[0]} did not exist")
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
7 end
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
8
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
9 file = ARGV[0]
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
10
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
11 File.open(file, "r").each_line(chomp: true).…
51e5f26dc81e Add a template file for reuse
IBBoard <dev@ibboard.co.uk>
parents:
diff changeset
12 # Rest of algorithm here