Computer Chess Club Archives

Search

Messages

Subject: Re: It's a pity that nobody showed the correctness of the attack (NT)

Author: Dann Corbit

Date: 10:49:25 05/30/00

Go up one level in this thread

Go right ahead.

Every chess opening might be refuted one day.  Every refutation might have
another refutation answer discovered.  Maybe the optimal opening is 1. f4 (for
all we really know).

There is no such thing as a proof of correctness unless it leads to irrefutable
checkmate.  You won't be able to accomplish this for the Halloween attack.
Therefore, it is only one of the quintillions of possibly viable openings.

• They did show the INcorrectness of the attack Albert Silver 12:31:16 05/30/00
  • Re: They did show the INcorrectness of the attack Robert Hyatt 14:53:45 05/30/00
    • Re: They did show the INcorrectness of the attack Albert Silver 23:52:29 05/30/00
• Re: It's a pity that nobody showed the correctness of the attack (NT) blass uri 11:22:55 05/30/00
  • Re: It's a pity that nobody showed the correctness of the attack (NT) Dann Corbit 12:29:44 05/30/00
    • Re: It's a pity that nobody showed the correctness of the attack (NT) blass uri 14:24:12 05/30/00

This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.