Back to Results
First PageMeta Content
Abstract strategy games / Combinatorial game theory / Board games / Mathematical games / Computer chess / Outline of chess / Nim / Transcendental chess / EXPTIME / Games / Chess / Chess variants


Nim is Easy, Chess is Hard — But Why??∗ Aviezri S. Fraenkel†‡§ January 7, 2007 Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100, Israel
Add to Reading List

Document Date: 2007-01-07 03:13:10

Open Document

File Size: 164,72 KB

Share Result on Facebook

City

Ann Arbor / Long Beach / /

Company

Oxford University Press / Computers Ltd. / /

/

Facility

Applied Mathematics Weizmann Institute of Science Rehovot / /

IndustryTerm

polynomial algorithm / printing / dumb search / polynomial time algorithm / inconceivable algorithm / /

Organization

Department of Computer Science / U.S. Chess Federation / Oxford University / Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot / J. Assoc. / /

Person

Lewis Dartnell / D. B. Burg / Steven Goldberg / Marianne Freiberger / T. Just / Gary Kasparov / /

Position

first player / Official / editor / king / chief editor / player / mathematician / /

ProvinceOrState

California / Michigan / /

Technology

polynomial time algorithm / polynomial algorithm / /

URL

http /

SocialTag