if (back && !(back==tback || back==tfwd)) continue;
if (fwd && !(fwd ==tback || fwd ==tfwd)) continue;
- if (movei->n_movfeats>1) {
- /* we have to search for the one which is least effort, then */
- tchanges= evaluate_target(move,tcomb,startpoint,0);
- if (tchanges >= bestchanges) /* prefer low-numbered movposcombs */
- continue;
- if (tchanges==-1) {
- tchanges= INT_MAX-1;
- /* fall through and update */
- }
- } else {
- tchanges= 1;
- }
+ /* we have to search for the one which is least effort */
+ tchanges= evaluate_target(move,tcomb,startpoint,0);
+
+ if (tchanges==-1)
+ /* mixed kinds */
+ tchanges= INT_MAX-1;
+
+ if (tchanges >= bestchanges) /* prefer low-numbered movposcombs */
+ continue;
+
bestcomb= tcomb;
bestchanges= tchanges;
}