Definitioncore
Consistent heuristic
Also called monotone heuristic, monotonic heuristic.
A heuristic satisfying h(n) <= c(n,n') + h(n') for every edge; implies admissibility and monotone f-values.
A heuristic satisfying h(n) <= c(n,n') + h(n') for every edge; implies admissibility and monotone f-values.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag ZX2TRR Edit this page History Report an error