Parallel Search to Fixed Depth
Posted: Sun Jan 17, 2016 4:15 pm
I understand that parallel search is not deterministic the way a single thread fixed depth search is.
However, I was just wondering if a fixed depth parallel search should be expected to produce the same score using different numbers of threads. Very limited testing with the newest and an older Crafty give different scores. Crafty's parallel search has been significantly improved recently, so at first I thought perhaps there was something there. I think both versions were JA compiles.
I would think fixed depth would eliminate timing differences resulting in some threads searching a bit deeper than others. I was also expecting fixed depth to rule out extensions to deeper depths in some threads with different scores getting backed up.
Thank you for your insights.
However, I was just wondering if a fixed depth parallel search should be expected to produce the same score using different numbers of threads. Very limited testing with the newest and an older Crafty give different scores. Crafty's parallel search has been significantly improved recently, so at first I thought perhaps there was something there. I think both versions were JA compiles.
I would think fixed depth would eliminate timing differences resulting in some threads searching a bit deeper than others. I was also expecting fixed depth to rule out extensions to deeper depths in some threads with different scores getting backed up.
Thank you for your insights.