From 8e489d513f354388fa888b280b7a06dd0b7993e4 Mon Sep 17 00:00:00 2001
From: H.G.Muller <hgm@hgm-xboard.(none)>
Date: Sun, 27 Mar 2016 11:22:41 +0200
Subject: [PATCH] Fix determination of EPD solving time

Repeating an already found solution would increase the solving time
like the repetition was the first good solution.
---
 backend.c |    2 +-
 1 files changed, 1 insertions(+), 1 deletions(-)

diff --git a/backend.c b/backend.c
index 7f8bc87..bfdba0f 100644
--- a/backend.c
+++ b/backend.c
@@ -9726,7 +9726,7 @@ FakeBookMove: // [HGM] book: we jump here to simulate machine moves after book h
 		    ChessMove mt;
 		    int ok = ParseOneMove(bestMove, forwardMostMove, &mt, &ff1, &fr1, &tf1, &tr1, &pp1);
 		    ok    &= ParseOneMove(pv, forwardMostMove, &mt, &ff2, &fr2, &tf2, &tr2, &pp2);
-		    solvingTime = (ok && ff1==ff2 && fr1==fr2 && tf1==tf2 && tr1==tr2 && pp1==pp2 ? time : -1);
+		    solvingTime = (ok && ff1==ff2 && fr1==fr2 && tf1==tf2 && tr1==tr2 && pp1==pp2 ? (solvingTime < 0 ? time : solvingTime) : -1);
 		}
 
 		if(serverMoves && (time > 100 || time == 0 && plylev > 7)) {
-- 
1.7.0.4