←back to thread

141 points baruchel | 1 comments | | HN request time: 0.91s | source
Show context
viraptor ◴[] No.45124051[source]
Is this something people have been actively trying to disprove? The example provided seems to not be hard to bruteforce - given it's only 5 moves. Does anyone know why there's no older counter example? (Or am I totally underestimating how the number of options explodes in 5 moves?)
replies(3): >>45124262 #>>45124346 #>>45129087 #
1. cottonseed ◴[] No.45129087[source]
You cannot bruteforce this. Exhibiting a unknotting of K with n moves only gives you an upper bound u(K) <= n. Proving u(K) = n is an entirely different matter.