Stockfish 2.2.2

[stockfish] / src / ucioption.cpp

diff --git a/src/ucioption.cpp b/src/ucioption.cpp
index 8ea4c5f62b3f2d45a47b1a33dbc0a624a318c9d9..42071b0a9560d1c866ec8757c3ffdb6554da5612 100644 (file)
--- a/src/ucioption.cpp
+++ b/src/ucioption.cpp
@@ -1,7 +1,7 @@
 /*
   Stockfish, a UCI chess playing engine derived from Glaurung 2.1
   Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
-  Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+  Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
 
   Stockfish is free software: you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
@@ -61,7 +61,7 @@ OptionsMap::OptionsMap() {
   o["Min Split Depth"]             = UCIOption(msd, 4, 7);
   o["Max Threads per Split Point"] = UCIOption(5, 4, 8);
   o["Threads"]                     = UCIOption(cpus, 1, MAX_THREADS);
-  o["Use Sleeping Threads"]        = UCIOption(true);
+  o["Use Sleeping Threads"]        = UCIOption(false);
   o["Hash"]                        = UCIOption(32, 4, 8192);
   o["Clear Hash"]                  = UCIOption(false, "button");
   o["Ponder"]                      = UCIOption(true);
@@ -81,9 +81,9 @@ OptionsMap::OptionsMap() {
 /// order (the idx field) and in the format defined by the UCI protocol.
 std::ostream& operator<<(std::ostream& os, const OptionsMap& om) {
 
-  for (size_t i = 0; i <= om.size(); i++)
+  for (size_t idx = 0; idx < om.size(); idx++)
       for (OptionsMap::const_iterator it = om.begin(); it != om.end(); ++it)
-          if (it->second.idx == i)
+          if (it->second.idx == idx)
           {
               const UCIOption& o = it->second;
               os << "\noption name " << it->first << " type " << o.type;