.

Author: Platane

packages/demo/demo.astar.ts

@@ -0,0 +1,26 @@
+import { createCanvas } from "./canvas";
+import "./menu";
+import { grid } from "./sample";
+
+(async () => {
+	const api = await import("@snk/solver-r");
+
+	const g = api.IGrid.create(grid.width, grid.height, grid.data);
+	const path = api.iastar(
+		g,
+		api.IPoint.create(-1, 0),
+		api.IPoint.create(47, 4),
+	);
+
+	{
+		const { canvas, draw, highlightCell } = createCanvas(g);
+		document.body.appendChild(canvas);
+
+		draw({ width: g.width, height: g.height, data: g.data }, [] as any, []);
+
+		if (path)
+			for (const p of path) {
+				highlightCell(p.x, p.y);
+			}
+	}
+})();

packages/demo/demo.json

@@ -1,10 +1,11 @@
 [
-  "interactive",
-  "getBestRoute",
-  "getBestTunnel",
-  "outside",
-  "getPathToPose",
-  "getPathTo",
-  "svg",
-  "rust"
+	"interactive",
+	"getBestRoute",
+	"getBestTunnel",
+	"outside",
+	"getPathToPose",
+	"getPathTo",
+	"svg",
+	"rust",
+	"astar"
 ]

packages/solver-r/src/lib.rs

@@ -1,10 +1,12 @@
+mod astar;
 mod grid;
 mod snake;
 mod snake_compact;
 mod snake_walk;
 mod solver;
 
-use grid::{Cell, Grid};
+use astar::get_path;
+use grid::{Cell, Grid, Point};
 use js_sys;
 use solver::get_free_cell;
 use wasm_bindgen::prelude::*;
@@ -67,6 +69,34 @@ impl From<IGrid> for Grid {
     }
 }
 
+#[wasm_bindgen]
+pub struct IPoint {
+    pub x: i8,
+    pub y: i8,
+}
+#[wasm_bindgen]
+impl IPoint {
+    pub fn create(x: i8, y: i8) -> IPoint {
+        IPoint { x, y }
+    }
+}
+impl From<Point> for IPoint {
+    fn from(value: Point) -> Self {
+        Self {
+            x: value.x,
+            y: value.y,
+        }
+    }
+}
+impl From<IPoint> for Point {
+    fn from(value: IPoint) -> Self {
+        Self {
+            x: value.x,
+            y: value.y,
+        }
+    }
+}
+
 #[wasm_bindgen]
 pub fn iget_free_cell(grid: &IGrid) -> js_sys::Uint8Array {
     let g = Grid::from(grid.clone());
@@ -77,3 +107,21 @@ pub fn iget_free_cell(grid: &IGrid) -> js_sys::Uint8Array {
 
     js_sys::Uint8Array::from(&o[..])
 }
+
+#[wasm_bindgen]
+pub fn iastar(grid: &IGrid, start: IPoint, end: IPoint) -> Option<js_sys::Array> {
+    let g = Grid::from(grid.clone());
+    let res = get_path(
+        |p| {
+            (!g.is_inside(p) || g.get_cell(p) <= Cell::Color1)
+                && (-3 <= p.x
+                    && p.x <= grid.width as i8 + 4
+                    && -3 <= p.y
+                    && p.y <= grid.height as i8 + 4)
+        },
+        &Point::from(start),
+        &Point::from(end),
+    );
+
+    res.map(|l| l.into_iter().map(IPoint::from).map(JsValue::from).collect())
+}

packages/solver-r/src/snake_walk.rs

@@ -1,10 +1,18 @@
 use std::collections::HashSet;
 
+use crate::astar::get_path;
 use crate::grid::{Cell, Grid, Point, DIRECTIONS};
 use crate::snake::{
     get_next_snake_head, get_snake_head, move_snake, snake_will_self_collide, Snake,
 };
 
+struct Node {
+    point: Point,
+    weight: u8,
+    h: u8,
+    parent: Option<Point>,
+}
+
 pub fn get_route_to_eat_all(
     grid: &Grid,
     walkable: Cell,
@@ -13,6 +21,8 @@ pub fn get_route_to_eat_all(
 ) -> Vec<Point> {
     // let mut targets: Vec<Point> = cells_to_eat.iter().map(|p| p.clone()).collect();
 
+    // let open_list = get_path(|p|);
+
     let mut targets: Vec<&Point> = cells_to_eat.iter().collect();
 
     let mut path: Vec<Point> = Vec::new();