IIRC Go has more positions...but evaluating Go positions should take less CPU horsepower than evaluating Chess positions.
this part gets medal in absurdness as well. congrats.
Go ahead and dig through some source code, we'll wait. I hate to inform you, but both Checkers and Go have simpler mechanics that make individual position evaluations easier for brute force computation.
I would think it's possible to make an opening book long enough to reach to the point that a tablebase could take over. If that counts, then there ya go. (?)
that book may be just one page ,or as thick as a mountain height.we still dont know just guessing.
That is an absurd statement.
that guy was possibly kidding,and i answered same ,if you couldnt catch it thats your problem,which make your comment absurd.
His comment was fine, if uninformed. Yours was absurd. I've bolded it for you.
You're not going to last here long.