The Snake-in-the-Box problem is the challenge of finding the longest possible induced path in the edge graph of an n-dimensional hypercube. Although the problem is unsolved in hypercubes of dimension 9 and above, research continues to refine lower and upper bounds on maximum possible path length. This paper demonstrates a new lower bound of 373 in the 10-dimensional case and describes the heuristics used in its discovery.