-const int halfDensityMap[][9] =
-{
- {2, 0, 1},
- {2, 1, 0},
-
- {4, 0, 0, 1, 1},
- {4, 0, 1, 1, 0},
- {4, 1, 1, 0, 0},
- {4, 1, 0, 0, 1},
-
- {6, 0, 0, 0, 1, 1, 1},
- {6, 0, 0, 1, 1, 1, 0},
- {6, 0, 1, 1, 1, 0, 0},
- {6, 1, 1, 1, 0, 0, 0},
- {6, 1, 1, 0, 0, 0, 1},
- {6, 1, 0, 0, 0, 1, 1},
-
- {8, 0, 0, 0, 0, 1, 1, 1, 1},
- {8, 0, 0, 0, 1, 1, 1, 1, 0},
- {8, 0, 0, 1, 1, 1, 1, 0 ,0},
- {8, 0, 1, 1, 1, 1, 0, 0 ,0},
- {8, 1, 1, 1, 1, 0, 0, 0 ,0},
- {8, 1, 1, 1, 0, 0, 0, 0 ,1},
- {8, 1, 1, 0, 0, 0, 0, 1 ,1},
- {8, 1, 0, 0, 0, 0, 1, 1 ,1},
-};
-
-
-// Thread::search() is the main iterative deepening loop. It calls search()
-// repeatedly with increasing depth until the allocated thinking time has been
-// consumed, the user stops the search, or the maximum search depth is reached.