Talk:Computer chess

The problem with this article given that it forked from an older edit of Wikipedia, is that it talks about Type A (bruteforce) winning over Type B, until the 90s where Type B reemerged.

This is very misleading of course as anyone who is a computer chess programmer knows. Even Chess 4.0 was not fully "brute force", since it had a quiescience search. Certainly other programs from then on always relied on a fully width search supplemented by a selective part of the search. Also the whole Deep Blue is 100% brute force is obviously nonsense. Deep blue for example is famous for singularity extensions. --Aaron Tay 23:46, 25 January 2007 (CST)