Enter #moves #minutes: 0 0
Operator time(hundredths)= 0

White 0:00  Black 0:00

 R N B Q K B N R
 P P P P P P P P
 - - - - - - - -
 - - - - - - - -
 - - - - - - - -
 - - - - - - - -
 p p p p p p p p
 r n b q k b n r

Book used 4649 of 5500 entries
Playing without hashfile

		There are 4649 unique position/move pairs in the book
		There is room for a maximum of 5499 entries but it
		should not be brought above 5400 because of the way they
		are stored.

		The hashfile gnuchess.hash was not found or was not writable.

Your move is? get
Enter file name: 
TEST/test1


White 0:00  Black 0:00

 - - - - - - - -
 - - - - - - - -
 - - P P - - - K
 - - - - - - - -
 - p - p - - - k
 - - - - - - - -
 - - - - - - - -
 - - - - - - - -


Your move is? white

Your move is? post

Your move is? level
Enter #moves #minutes: 40 5
Operator time(hundredths)= 0

Your move is? go


Move# 1    Target= 0    Clock: 3600000
 2.   -289    0      172   e4d4  h2g3  a4a5 
 3&   -304    0      380   e4d4  h2g3  a4a5  g3b8 
 3.   -304    0      595   e4d4  h2g3  a4a5  g3b8 
 4&   -340    0      975   e4d4  h2g3  a4a5  g3f2  d4d3  h5h4 
 4&   -281    0     1571   a4a5  h2g3  a5a6  g3b8  e4d4 
 4.   -281    0     2074   a4a5  h2g3  a5a6  g3b8  e4d4 
 5&   -297    1     3902   a4a5  h2g3  a5a6  g3b8  e4d4  b8a7  d4e5 
 5.   -297    1     4403   a4a5  h2g3  a5a6  g3b8  e4d4  b8a7  d4e5 
 6&   -297    3     8783   a4a5  h2g3  a5a6  g3b8  e4d4  b8a7  d4e5 
 6.   -297    3    11386   a4a5  h2g3  a5a6  g3b8  e4d4  b8a7  d4e5 
 7&   -326    6    25289   a4a5  h2g3  a5a6  g3b8  e4d4  h5h4  d4e4  h4h3 
 7.   -326    7    28806   a4a5  h2g3  a5a6  g3b8  e4d4  h5h4  d4e4  h4h3 
 8&   -326   15    69887   a4a5  h2g3  a5a6  g3b8  e4d4  h5h4  d4e4  h4h3 
 8.   -326   17    84289   a4a5  h2g3  a5a6  g3b8  e4d4  h5h4  d4e4  h4h3 
 9&   -438   47   254540   a4a5  h2g3  a5a6  g3b8  e4d4  h5h4  d4e4  h4h3 
                           e4f3  h3h2  f3g2 
 9&   -415   76   407415   e4d4  h2g3  d4e4  g3e1  e4f5  h5h4  f5g4  d1e2 
                           a4a5  e1a5  g4h4 
 9&   -328   89   479370   d5d6  e7d6  e4d3  h2g3  a4a5 
 9.   -328   90   482591   d5d6  e7d6  e4d3  h2g3  a4a5 
10+   -211  111   596164   d5d6  d4d3  d6e7  h2g1  e7e8 
10&   -117  122   650950   d5d6  e7d6  e4d3  h5h4  g3h4  h2e5  a4a5  d6d5 
                           a5a6  e5b8  d3d4 
10.   -117  128   685069   d5d6  e7d6  e4d3  h5h4  g3h4  h2e5  a4a5  d6d5 

1. ... d5d6
Gen 12148020 Node 3197376 Tree 424 Eval 706611 Rate 5689 EC 164077/542535 RS hi 0 lo 2 
Hin/Hout/Tcol/Coll/Fin/Fout = 99838/401419/0/0/0/0
My move is: d5d6

where:
	. = Final result of this level
	& = Intermediate best move inside <alpha beta> window
	+ = best move greater than beta in <alpha beta> window
	- = best move less than alpha in <alpha beta> window
	   If best move is outside window it will cause a re-search high or low
	   if it persists at end of level, + always causes a re-search.
	   These are only printed above level 2.

        Gen   = Number of moves generated during this search
	Nodes = Number of moves examined
	Tree  = Maximum entries in the search tree at any one time
	Eval  = Number of static position evaluations done
	Rate  = Search rate in positions/sec
	EC    = Static Evaluations cached/retrieved from cache
	RS    = Re-searches high and low forced by the window
	Hin   = Number of entries created in in-core transposition table
	Hout  = Number of entries found in in-core transposition table
	Tcoll = Number of overwrites in transposition table
	Coll  = Number of collisions in in-core transposition table
	Fin   = Number of entries created in external transposition table
	Fout  = Number of entries found in external transposition table

