Can an Optimal Stopping strategy be applied to search functions? Can the solution to the famous Secretary Problem be applied to the search function of a chess engine? Rejecting the first 37% moves and choosing the best one after that,or maybe even just checking the first 63% of the moves and choosing the best one so far?
No. What if recapturing your queen for an exchange is your first 
candidate move?