Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
philipov
on May 7, 2019
|
parent
|
context
|
favorite
| on:
Magic: The Gathering is Turing Complete
It is board size for Go, because the starting condition is an empty board. For chess, I would expect the complexity to also be a function of the number of pieces, and possibly the types of pieces.
Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
