From 44a0bdb57114d7cc62b0500bedbc32b1d76cbd44 Mon Sep 17 00:00:00 2001 From: ShenMian Date: Sat, 1 Feb 2025 18:03:12 +0000 Subject: [PATCH] . --- scripts/clear_history.bat | 12 ++++++------ scripts/clear_history.sh | 12 ++++++------ src/level/normalization.md | 2 +- src/solver/README.md | 2 +- 4 files changed, 14 insertions(+), 14 deletions(-) diff --git a/scripts/clear_history.bat b/scripts/clear_history.bat index db6cc95..5adc772 100644 --- a/scripts/clear_history.bat +++ b/scripts/clear_history.bat @@ -2,11 +2,11 @@ cd %~dp0/.. || exit /b 1 -git checkout --orphan empty || exit /b 1 -git branch -D main || exit /b 1 -git add -A || exit /b 1 -git commit -m "." || exit /b 1 -git push origin empty:main --force || exit /b 1 -git checkout main || exit /b 1 +git checkout --orphan empty || exit /b 1 +git branch -D main || exit /b 1 +git add -A || exit /b 1 +git commit -m "feat: initial commit" || exit /b 1 +git push origin empty:main --force || exit /b 1 +git checkout main || exit /b 1 git branch -D empty git pull origin main --allow-unrelated-histories diff --git a/scripts/clear_history.sh b/scripts/clear_history.sh index 6ecf0a5..188a424 100644 --- a/scripts/clear_history.sh +++ b/scripts/clear_history.sh @@ -2,11 +2,11 @@ cd "$( cd "$( dirname "$0" )" && pwd )/.." || exit -git checkout --orphan empty || exit 1 -git branch -D main || exit 1 -git add -A || exit 1 -git commit -m '.' || exit 1 -git push origin empty:main --force || exit 1 -git checkout main || exit 1 +git checkout --orphan empty || exit 1 +git branch -D main || exit 1 +git add -A || exit 1 +git commit -m 'feat: initial commit' || exit 1 +git push origin empty:main --force || exit 1 +git checkout main || exit 1 git branch -D empty git pull origin main --allow-unrelated-histories diff --git a/src/level/normalization.md b/src/level/normalization.md index c2f6c8f..7a6b031 100644 --- a/src/level/normalization.md +++ b/src/level/normalization.md @@ -4,7 +4,7 @@ 标准化的目的是移除这些与求解无关或冗余的元素. 理想情况下, 任何具有相同步数最优解的关卡都可以标准化为同一个关卡. 理论上, 可以先对关卡进行自动求解, 获得最优解决方案后, 再[从解决方案构造关卡](parse_level.md#从解决方案构造关卡)来得到标准化后的关卡. -然而, 对于 PSPACE-complete 的推箱子问题来说, 通过自动求解获得最优解决方案通常是耗时且困难的, 因此还需要一种不依赖于关卡解决方案的高效(多项式时间内得出结果)标准化方法. 尽管该方法得到的标准化结果并不完美. +然而, 对于PSPACE完全的推箱子问题来说, 通过自动求解获得最优解决方案通常是耗时且困难的, 因此还需要一种不依赖于关卡解决方案的高效(多项式时间内得出结果)标准化方法. 尽管该方法得到的标准化结果并不完美. 关卡的标准化可以分为以下几个步骤: diff --git a/src/solver/README.md b/src/solver/README.md index 61a1dbc..163fa0a 100644 --- a/src/solver/README.md +++ b/src/solver/README.md @@ -52,7 +52,7 @@ graph TD A\* 与 BFS 在最坏情况下的时间复杂度均为 $O(b^d)$. 但 A\* 算法是一种最佳优先搜索(Best-first search)算法, 会优先探索最有希望的节点. -- IDA* 搜索算法[^4] +- IDA\* 搜索算法[^4] 相比空间复杂度为 $O(b^d)$ 的 A\* 算法, IDA\* 算法的空间复杂度为 $O(d)$.