发表新帖
发表新帖

How to determine a heuristic is consistance?

后端 未结
关注
0 1037
被撕碎了的回忆
被撕碎了的回忆 2021-02-04 04:06
  1. Graph search, without re-opening closed nodes – Need consistency
  2. Graph search, with re-opening closed nodes – Admissibility is enough

But How to pro

相关标签:
回答
  • 消灭零回复
 看不清?
提交回复
热议问题