Re: How long would it take a computer to completely "solve" chess?
From: Guy Macon (http://www.guymacon.com)
Date: 09/11/04
- Next message: James Harris: "Amateur math, neat relation"
- Previous message: Isaac: "A_4, alternating group"
- In reply to: David Bandel: "Re: How long would it take a computer to completely "solve" chess?"
- Next in thread: Robert Tucci: "Re: How long would it take a computer to completely "solve" chess?"
- Messages sorted by: [ date ] [ thread ]
Date: Fri, 10 Sep 2004 17:57:21 -0700
David Bandel <dwb1729@yahoo.com> says...
>I agree. I've given the problem some thought during the past few days
>and I don't really see a way in which a computation which involves a
>tree could be executed significantly faster on a quantum computer.
I believe that Grover’s algorithm applies to some sorts of trees,
but whether chess is one on them is not clear.
- Next message: James Harris: "Amateur math, neat relation"
- Previous message: Isaac: "A_4, alternating group"
- In reply to: David Bandel: "Re: How long would it take a computer to completely "solve" chess?"
- Next in thread: Robert Tucci: "Re: How long would it take a computer to completely "solve" chess?"
- Messages sorted by: [ date ] [ thread ]