A* search algorithm: Difference between revisions
Content added Content deleted
(added Raku programming solution) |
|||
| Line 2,866: | Line 2,866: | ||
my @grid = [ ['.' xx w ] xx h ]; |
my @grid = [ ['.' xx w ] xx h ]; |
||
for ^h -> \y { @grid[y;0] = "█"; @grid[y;*-1] = "█" } |
for ^h -> \y { @grid[y;0] = "█"; @grid[y;*-1] = "█" } |
||
for ^ |
for ^w -> \x { @grid[0;x] = "█"; @grid[*-1;x] = "█" } |
||
for (graph.barriers) -> \d { @grid[d[0]+1][d[1]+1] = "█" } |
for (graph.barriers) -> \d { @grid[d[0]+1][d[1]+1] = "█" } |
||