In this paper the author deals with game tree search procedures that could be recognized as variant of the minimax procedure. He investigates so called ''pathological'' games for which deeper searching could have a negative influence on quality of decisions. Some causes of such pathology are discussed. It is shown e.g. that pathology is less likely for such games for which game positions can be reached by more than one path, or more generally, when sibling nodes have similar minimax values. Moreover, probability estimation and other related methods are discussed as alternatives to the minimaxing method. Probability estimation is found as a method which could produce more accurate decisions when a suitable evaluation function is used.