Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
gcp
on Sept 7, 2011
|
parent
|
context
|
favorite
| on:
Chess@home: Building the largest Chess AI ever (in...
Simple improvements in the tree search algorithms to reduce the effective branching factor are enough. Those have
exponential
effects.
Improving the evaluation function is "merely" a constant improvement.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Improving the evaluation function is "merely" a constant improvement.