Improve the best-known longest snake (snake-in-the-box) in the 9-dimensional hypercube beyond length 190

A snake (snake-in-the-box) in the hypercube graph $Q_n$ is an induced (chordless) simple path: a sequence of distinct vertices in $\{0,1\}^n$, consecutive vertices differing in exactly one bit, such that no two non-consecutive vertices of the path are adjacent in $Q_n$. Its length is the number of edges. Let $\lambda(n)$ be the maximum snake length in $Q_n$. Exact values are known only for $n \le 8$: $\lambda(8)=98$. For $n=9$ the exact maximum is open; the best known snake has length 190. Exhibit an induced path in $Q_9$ of length at least 191, improving the lower bound on $\lambda(9)$.

Acceptance. FULLY (advances the frontier): an induced path in $Q_9$ of length $\ge 191$ - given as the ordered vertex list (or the sequence of bit-flip transitions) - verified by checking (i) all vertices are distinct, (ii) consecutive vertices differ in exactly one bit, and (iii) no two non-consecutive vertices are at Hamming distance 1. This raises the lower bound on $\lambda(9)$. FULLY RESOLVES: additionally, a proof that $\lambda(9)$ equals the exhibited value (matching upper bound). PARTIAL: a snake matching the current record (190) via an independent construction. Provide the transition sequence and a verifier.