We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
即,如README描述,设定为“到目当前状态为止,所有箱子按顺序排列的位置和所有目的地按顺序排列的位置,两两间的manhatten distance总和”是可能大于真实需要步数的(从README中,A*算法在level1中不能得到最优解RurrddddlDRuuuuLLLrdRDrddlLdllUUdR也可以说明此问题)。 提供两个简单的admissible heuristic function的想法:
The text was updated successfully, but these errors were encountered:
No branches or pull requests
即,如README描述,设定为“到目当前状态为止,所有箱子按顺序排列的位置和所有目的地按顺序排列的位置,两两间的manhatten distance总和”是可能大于真实需要步数的(从README中,A*算法在level1中不能得到最优解RurrddddlDRuuuuLLLrdRDrddlLdllUUdR也可以说明此问题)。
提供两个简单的admissible heuristic function的想法:
The text was updated successfully, but these errors were encountered: