[thomasahle]

Actually it just might be possible to do, at least in a probabilistic sense. The author of Rybka at least managed to 'prove' (in a weak sense) that a certain opening is unplayable. Quite facinating: http://en.chessbase.com/post/rajlich-busting-the-king-s-gamb...

[ajkjk]

That article is an April Fool's joke. See http://en.chessbase.com/post/the-chebase-april-fool-s-prank.

[thomasahle]

A second of April joke. Cheeky. The follow up comments from Vas Rajlich are still interesting though.

[slm_HN]

Vas Rajlich could write a program that solved chess. He would simply have to find an existing program that solved chess and copy it.