Tiny chess in action

This is a log from the initial position, white moving with the openings book off (otherwise I cannot measure the speed improvements):


11:20:31, Send: 1 57 0 43 Ngf3 
11:20:31, Send: 2 0 0 227 Ngf3 Ngf6 
11:20:31, Send: 3 57 0 503 Ngf3 Ngf6 Nbc3 
11:20:31, Send: 4 0 31 2208 Ngf3 Ngf6 Nbc3 Nbc6 
11:20:31, Send: 5 27 31 4100 Ngf3 Ngf6 Nbc3 Nbc6 e3 
11:20:31, Send: 6 13 141 12055 Nbc3 Nbc6 d4 Ngf6 e4 e6 
11:20:31, Send: 7 29 500 39259 Nbc3 Nbc6 Ngf3 Ngf6 e3 d5 Bfd3 
11:20:33, Send: 8 10 1734 137817 Nbc3 Ngf6 Ngf3 Nbc6 e3 d5 Bfb5 Bcd7 
11:20:36, Send: 9 24 2438 246414 Nbc3 Ngf6 Ngf3 Nbc6 d4 d5 Bcf4 Bcf5 e3 
11:20:45, Send: 10 31 9594 624118 Nbc3 Nbc6 Ngf3 e6 e4 Bfb4 Bfd3 Bbxc3 dxc3 Ngf6 

It took 14 seconds to search to depth 10, the nodes searches were 1.066.744, not bad, but not enough to beat the oponents out there... (crafty searches 1.000.000 nodes per second while I search 75.000, of course my goal is not to get close to that, but at least double or triple that number)

As the engines goes deeper it might change the chain of moves, as you can see it starts with Ngf6 and ends selecting Nbc6 (even if the score if worse), BTW this is the so called "Iterative Deepining"