Computer Chess Club Archives

Search

Terms

Messages

Subject: Solving chess

Author: Eberhard

Date: 08:12:38 08/02/05

Quantum computers could solve chess in combination with alpha-beta pruning
(iterative deepening), theoretically speaking.

These techniques each reduce the average number of branches of the game tree by
2 - and jointly the combination appears to reduce the tree size to one that
might be completed in a practical time; about 10^(50/4) ~ 10^13 positions, which
could be completed on a single computer in a year at only ~100,000 positions per
second.

http://en.wikipedia.org/wiki/Computer_chess

Re: Solving chess Angrim 13:45:33 08/04/05
- Re: Solving chess gerold daniels 18:38:13 08/04/05
  - Re: Solving chess Angrim 15:24:07 08/05/05
    - Re: Solving chess gerold daniels 19:32:10 08/05/05
Re: Solving chess Stefano Gemma 13:42:49 08/03/05
Re: No need of quantum p.c....(N.T.) Otello Gnaramori 10:59:55 08/02/05
Re: Solving chess Dan Andersson 10:06:15 08/02/05
Re: Solving chess Pallav Nawani 09:33:33 08/02/05
Re: Solving chess Uri Blass 09:25:49 08/02/05
- Re: Solving chess Janosch Zwerensky 09:31:44 08/02/05
Re: Solving chess Janosch Zwerensky 09:24:10 08/02/05
- Re: Solving chess Eberhard 14:21:35 08/02/05
  - Re: Solving chess Otello Gnaramori 10:41:18 08/03/05

This page took 0.01 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.