Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
klyrs
on April 12, 2024
|
parent
|
context
|
favorite
| on:
Here's a puzzle game. I call it Reverse the List o...
Optimizing self-response! That fails for six because n-3 and 3 co-occur. With a slight modification we can make it work for all n>5
[n, n-1] [2, n-2, n-1] [2, n-3, 1, n-1] [2, n-3, n] [n-1, n]
edit: and it's not hard to show that n<6 are impossible, so the solution above is optimal in that sense.
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: