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.