# Good examples of consistent/admissible heuristics in non-graphical domains?

I'm preparing lectures for intro to AI, and would like to give non-boring examples of heuristic functions.

Does anyone know examples of non-trivial consistent/admissible heuristics in non-geographic domains? Ones that appear in recent research papers are preferable.

Many thanks!

• Warnsdorff algorithm for computing a path on a $n \times n$ chessboard : mathworld.wolfram.com/KnightGraph.html. Not recent at all (beginning of 19th century) ! – Jean Marie Becker Jan 6 at 7:46
• This is excellent, thanks @JeanMarieBecker – Spark Jan 6 at 13:39