Computer Chess Club Archives

Search

Messages

Subject: Re: is Chess a Hard NP? - No!

Author: Volker Annuss

Date: 04:41:30 01/20/05

Go up one level in this thread

The number of possible positions as well as the number of possible games is
limited.

• Re: is Chess a Hard NP? - No! Robert Hyatt 07:25:22 01/20/05
  • Re: is Chess a Hard NP? - No! Oreopoulos Kostas 11:21:03 01/24/05
    • Re: is Chess a Hard NP? - No! Dann Corbit 13:10:35 01/24/05
      • Re: is Chess a Hard NP? - No! Dann Corbit 13:14:18 01/24/05
        • Re: is Chess a Hard NP? - No! Robert Hyatt 08:45:09 01/25/05
          • The complexity of solving chess is O(1) Omid David Tabibi 09:59:28 01/25/05
            • Re: The complexity of solving chess is O(1) Robert Hyatt 10:41:49 01/25/05
  • Re: is Chess a Hard NP? - No! Dann Corbit 13:40:51 01/20/05

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.