block
verse
w
o
rdys
billionaire
.ai
your
list
Whiteboard
App
quizie
un
school
New Journal
News
Home
Popular
Elections
Share
Genius — OpenServe
Sponsored
Computing a perfect strategy for n × n chess requires time exponential in n — latest news, discussion & facts — IJR
Computing a perfect strategy for n × n chess requires time exponential in n
Share
scholarly article
Computing a perfect strategy for n × n chess requires time exponential in n
scientific article (publication date: September 1981)
Ask Genius
Site
Site
Journal
Feed
Discussions
About
About Computing a perfect strategy for n × n chess requires time exponential in n
