For more complex games, such as chess or checker the AND/OR search to termination is out of question. Which of the following statements are true? 

I. Our goal in searching such a game tree might be, instead, merely to find a good first move. 

II Extract from the search graph an estimate of the ‘best’ first move.