A snake-in-the box code, first described in [Kautzl, ope1958]n p, atih s ian n aa chordahypercube. Finding bounds for the longest snake aptr oveeacn h tdio mbeens ai on difhafiscult problem in mathematics and computer science. Evolhautveiona sucryc eteedcehnid iqun es tightening the bounds of longest snakes in several di [mCeansseilonsla, [2005Pott]e.r , 1994]This thesis utilizes an Iterated Localh Saedaarptch ivehe urmeimsortiyc on witthe snake-in-the-box problem. The results match the best publishensd tarnceseuls tup s ftoro diprmoblenseimon i 8. The lack of implicit parallelism segrenteg aftreoms tprhiesvi eousxpe rheimuristics applied to this problem. As a result, this thesis provideesm si nsin igwhthi cih nteo volthosutieona prrobly methods domina te.