Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
wedog6
67 days ago
|
parent
|
context
|
favorite
| on:
How to store a chess position in 26 bytes (2022)
Heuristic: (65/64)^64 is extremely close to e. This comes from a classic formula for e as the limit of (1+1/n)^n.
Therefore (65/64)^32 is roughly sqrt(e). Since 1 < e < 4, 1 < sqrt(e) < 2. So 65^32 < 2 * 64^32.
fallingfrog
61 days ago
[–]
Thats a lovely observation! Very clever.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Therefore (65/64)^32 is roughly sqrt(e). Since 1 < e < 4, 1 < sqrt(e) < 2. So 65^32 < 2 * 64^32.