maze-test 0.3.0 → 0.4.0

package/README-CN.md

@@ -178,6 +178,12 @@ pnpm check
 
 构建结果同时包含 ESM、CommonJS、类型声明和 source map。
 
+## 参与贡献
+
+欢迎通过 GitHub 提交错误报告、规则和文案改进、新机制、测试、文档，以及可复现的模型评测成绩。开发流程和评测报告要求请参阅 [CONTRIBUTING.md](./CONTRIBUTING.md)。
+
+当前的模型对比报告位于 [`benchmarks/`](./benchmarks/default-maze-model-comparison-2026-09-17.md)。欢迎提交任何模型、任何平台的结果；报告需要保留原始回答，并记录准确的模型、推理设置、试题参数、工具权限和评分方式。
+
 ## 许可证
 
 [MIT](./LICENSE) © ziioai

package/README.md

@@ -191,6 +191,12 @@ pnpm check
 
 The build emits ESM, CommonJS, type declarations, and source maps to `dist/`.
 
+## Contributing
+
+Bug reports, rule and wording improvements, new mechanisms, tests, documentation, and reproducible model evaluation results are welcome. See [CONTRIBUTING.md](./CONTRIBUTING.md) for the development workflow and benchmark submission requirements.
+
+The current comparison report is available under [`benchmarks/`](./benchmarks/default-maze-model-comparison-2026-09-17.md). Results from any model or platform are welcome; scores should preserve the raw response and document the exact model, reasoning setting, parameters, tool access, and scoring method.
+
 ## License
 
 [MIT](./LICENSE) © ziioai

package/dist/cli.cjs

@@ -362,7 +362,8 @@ function analyzeSolidCellMaze(maze) {
   const distances = bfsDistances(maze.entry, graph);
   const degreeValues = [...graph.values()].map((items) => items.length);
   const edgeCount = degreeValues.reduce((sum, value) => sum + value, 0) / 2;
-  const mainPath = shortestPath(maze, maze.entry, maze.goal);
+  const mainPath = shortestPathInGraph(graph, maze.entry, maze.goal);
+  const entryGoalSeparators = separatingCellKeys(graph, maze.entry, maze.goal);
   const objectCounts = {};
   for (const object of maze.objects ?? []) {
     objectCounts[object.type] = (objectCounts[object.type] ?? 0) + 1;
@@ -380,7 +381,7 @@ function analyzeSolidCellMaze(maze) {
     entryGoalDistance: mainPath.length > 0 ? mainPath.length - 1 : null,
     doorCount: maze.doors.length,
     gatingDoorCount: maze.doors.filter(
-      (door) => shortestPath(maze, maze.entry, maze.goal, door.position).length === 0
+      (door) => entryGoalSeparators.has(cellKey(door.position))
     ).length,
     objectCounts
   };
@@ -450,6 +451,9 @@ function validateSolidCellMaze(maze) {
 function shortestPath(maze, start, goal, excludedCell = null) {
   if (excludedCell && (sameCell(start, excludedCell) || sameCell(goal, excludedCell))) return [];
   const graph = adjacency(maze, excludedCell);
+  return shortestPathInGraph(graph, start, goal);
+}
+function shortestPathInGraph(graph, start, goal) {
   const queue = [start];
   const parent = /* @__PURE__ */ new Map([[cellKey(start), null]]);
   const values = /* @__PURE__ */ new Map([[cellKey(start), start]]);
@@ -581,12 +585,14 @@ function degreeMap(maze) {
 }
 function selectGatingDoorIndices(maze, mainPath, count) {
   if (count === 0) return [];
-  const degrees = degreeMap(maze);
+  const graph = adjacency(maze);
+  const separators = separatingCellKeys(graph, maze.entry, maze.goal);
   const candidates = [];
   for (let index = 3; index < mainPath.length - 3; index += 1) {
     const pathCell = mainPath[index];
-    if (!pathCell || (degrees.get(cellKey(pathCell)) ?? 0) !== 2) continue;
-    if (shortestPath(maze, maze.entry, maze.goal, pathCell).length === 0) candidates.push(index);
+    if (!pathCell) continue;
+    const key = cellKey(pathCell);
+    if ((graph.get(key)?.length ?? 0) === 2 && separators.has(key)) candidates.push(index);
   }
   if (candidates.length < count) {
     throw new Error(`Only ${candidates.length} non-bypassable path cells are available for ${count} doors.`);
@@ -605,6 +611,59 @@ function selectGatingDoorIndices(maze, mainPath, count) {
   if (selected.length !== count) throw new Error(`Could not space ${count} doors along the main path.`);
   return selected.sort((left, right) => left - right);
 }
+function separatingCellKeys(graph, start, goal) {
+  const startKey = cellKey(start);
+  const goalKey = cellKey(goal);
+  if (!graph.has(startKey) || !graph.has(goalKey)) return /* @__PURE__ */ new Set();
+  const discovered = /* @__PURE__ */ new Map();
+  const low = /* @__PURE__ */ new Map();
+  const parent = /* @__PURE__ */ new Map([[startKey, null]]);
+  const stack = [
+    { key: startKey, nextNeighbor: 0 }
+  ];
+  let order = 1;
+  discovered.set(startKey, order);
+  low.set(startKey, order);
+  while (stack.length > 0) {
+    const frame = stack.at(-1);
+    if (!frame) break;
+    const adjacent = graph.get(frame.key) ?? [];
+    const next = adjacent[frame.nextNeighbor];
+    if (next) {
+      frame.nextNeighbor += 1;
+      const nextKey = cellKey(next);
+      if (!discovered.has(nextKey)) {
+        order += 1;
+        discovered.set(nextKey, order);
+        low.set(nextKey, order);
+        parent.set(nextKey, frame.key);
+        stack.push({ key: nextKey, nextNeighbor: 0 });
+        continue;
+      }
+      if (nextKey !== parent.get(frame.key)) {
+        low.set(frame.key, Math.min(low.get(frame.key) ?? order, discovered.get(nextKey) ?? order));
+      }
+      continue;
+    }
+    stack.pop();
+    const parentKey = parent.get(frame.key);
+    if (parentKey) {
+      low.set(parentKey, Math.min(low.get(parentKey) ?? order, low.get(frame.key) ?? order));
+    }
+  }
+  if (!discovered.has(goalKey)) return /* @__PURE__ */ new Set();
+  const separators = /* @__PURE__ */ new Set();
+  let childKey = goalKey;
+  while (childKey !== startKey) {
+    const parentKey = parent.get(childKey);
+    if (!parentKey) break;
+    if (parentKey !== startKey && (low.get(childKey) ?? Number.POSITIVE_INFINITY) >= (discovered.get(parentKey) ?? Number.NEGATIVE_INFINITY)) {
+      separators.add(parentKey);
+    }
+    childKey = parentKey;
+  }
+  return separators;
+}
 function freePathCellBefore(mainPath, preferredIndex, occupied) {
   for (let distance = 0; distance < mainPath.length; distance += 1) {
     for (const index of [preferredIndex - distance, preferredIndex + distance]) {