CuckooChess: Changed node counters to long to avoid wraparound on long searches.

This commit is contained in:
Peter Osterlund
2011-11-26 13:50:15 +00:00
parent 0dcdaeaa74
commit c8b0b8a1d3
5 changed files with 28 additions and 22 deletions

View File

@@ -95,7 +95,7 @@ public class EngineControl {
os.printf("info currmove %s currmovenumber %d%n", moveToString(m), moveNr);
}
public void notifyPV(int depth, int score, int time, int nodes, int nps, boolean isMate,
public void notifyPV(int depth, int score, int time, long nodes, int nps, boolean isMate,
boolean upperBound, boolean lowerBound, ArrayList<Move> pv) {
StringBuilder pvBuf = new StringBuilder();
for (Move m : pv) {
@@ -112,7 +112,7 @@ public class EngineControl {
depth, isMate ? "mate" : "cp", score, bound, time, nodes, nps, pvBuf.toString());
}
public void notifyStats(int nodes, int nps, int time) {
public void notifyStats(long nodes, int nps, int time) {
os.printf("info nodes %d nps %d time %d%n", nodes, nps, time);
}
}