Does there exist an algorithm that would play perfect chess if given infinite processing power? – chess.stackexchange.com

Does there exist an algorithm that would play perfect chess if given infinite processing power? – chess.stackexchange.com

13:21 No Comments
Does there exist such an algorithm? If so, where can I find pseudo code for it?

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

0 Comment to "Does there exist an algorithm that would play perfect chess if given infinite processing power? – chess.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)