Thank you, I should have thought of it in that (Time complexity) context. Time complexity is not just about how long it takes but also about the nature of the problem. Chess is neither P nor NP, but the question of complexity is certainly related.
Maybe my question is: Why can there be a Heuristic that does fairly well and is nowhere near exponential? Even a count of the pieces left on the board usually says something that only a full search can prove.
“Why can I have little information but still have to search a huge state space, why can’t I go straight to the conclusion/action?”
There’s no answer for this question, if you find one, pick your prize of 1million dollars:
https://en.wikipedia.org/wiki/P_versus_NP_problem
Here is a video explaining it better: https://www.youtube.com/watch?v=YX40hbAHx3s
Thank you, I should have thought of it in that (Time complexity) context. Time complexity is not just about how long it takes but also about the nature of the problem. Chess is neither P nor NP, but the question of complexity is certainly related.
Maybe my question is: Why can there be a Heuristic that does fairly well and is nowhere near exponential? Even a count of the pieces left on the board usually says something that only a full search can prove.