@4044
"10^14 is a good ballpark estimate of the forward search effort." [ . . . ]
Not objections, just red herring.
It's worse than that. He doesn't know what he's talking about and also totally dishonest, as an attempt to conceal that fact. I wasn't sure whether it was dishonesty or dementia. Now he miraculously has a search tree AND a proof tree. Haven't noticed him mention that before. Effectively, every position needs a search tree, which also doubles as a proof tree. However, many more processes are involved. Relevant positions have to be stored and compared with positions obtained where disparate chess lines converge. The storage itself becomes impossible. I think he's confusing "proof tree" with forward, analytical search, as is performed by search engines. That is because a "proof tree" is impossible until there is a sufficient body of stored results.
Basically he's trying to make it up as he goes along, as I am now, myself, except I may be a bit more convincing than he is, despite his undoubtedly vast experience in the field of computing, compared with my merely passing year one of a computing degree before switching to philosophy and having been a software writing home hobbyist in the distant past, in the mid 1980s. Anyhow, there's no doubt he is arguing dishonestly, without any intention at all of trying to discuss his ideas. His inventing new bits ad hoc proves that. He'll probably claim to have mentioned it 5000 posts ago, in another thread, in 1323. Therefore, you cannot win.
@4044
"10^14 is a good ballpark estimate of the forward search effort." [ . . . ]
Not objections, just red herring.