.

Author: Platane

packages/solver-r/src/grid.rs

@@ -88,6 +88,15 @@ impl<T: Copy> Grid<T> {
     pub fn is_inside_margin(&self, p: &Point, m: i8) -> bool {
         -m <= p.x && p.x < (self.width as i8) + m && -m <= p.y && p.y < (self.height as i8) + m
     }
+
+    /**
+     * ⚠️ assuming the point is inside the grid
+     */
+    pub fn distance_from_outside(&self, p: &Point) -> u8 {
+        let x = p.x as u8;
+        let y = p.y as u8;
+        y.min(self.height - 1 - y).min(x).min(self.width - 1 - x)
+    }
     pub fn iter(&self) -> impl Iterator<Item = Point> {
         let mut i = 0;
         let width = self.width;

packages/solver-r/src/solver.rs

@@ -1,7 +1,8 @@
 use std::collections::HashSet;
 
+use crate::exit_cost_grid::get_exit_cost_grid;
 use crate::exitable::propagate_exitable;
-use crate::grid::{Color, Grid, Point, DIRECTIONS};
+use crate::grid::{Color, Grid, Point};
 use crate::snake_walk::get_path_to_eat_all;
 
 pub fn get_path_to_eat_everything(color_grid: &Grid<Color>, snake: &[Point]) -> Vec<Point> {
@@ -25,11 +26,17 @@ pub fn get_path_to_eat_everything(color_grid: &Grid<Color>, snake: &[Point]) ->
         let (mut sub_path, cells_unexitable) =
             get_path_to_eat_all(&color_grid, walkable, snake, &exitable_eatable);
 
+        for p in sub_path.iter() {
+            color_grid.set(&p, Color::Empty);
+        }
+
         sub_path.append(&mut path);
         path = sub_path;
 
         //
         // let's eat the one that are reachable but not exitable
+
+        let exit_cost_grid = get_exit_cost_grid(&color_grid);
     }
 
     path