- #1
Eidos
- 108
- 1
Hi All
Is there a proof that all blind-memoryless search strategies are equivalent?
By equivalent I mean that no blind-memoryless search strategy can outperform any other in terms of time to goal and domain coverage.
It seems to me that this is intuitively true.
How would I go about proving it?
Thanks :-)
Is there a proof that all blind-memoryless search strategies are equivalent?
By equivalent I mean that no blind-memoryless search strategy can outperform any other in terms of time to goal and domain coverage.
It seems to me that this is intuitively true.
How would I go about proving it?
Thanks :-)