Hi All(adsbygoogle = window.adsbygoogle || []).push({});

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 :-)

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Proof: All Blind-Memoryless search strategies are equivalent

**Physics Forums | Science Articles, Homework Help, Discussion**