user13789: [FEN "8/8/8/8/8/pNnbPPpN/RBppPbrP/pkKPrqQR b - - 0 1"]

I was introduced to a challenge a few weeks ago with the above position. The challenge is to move the Black Knight such that it must always be three squares in the third row from the right, the point is to capture all pieces with the Black Knight. The order of the other pieces doesn't matter.
While an answer is awesome, what I'm mainly interested in is, is this really a thing?

user-1: As @Glorfindel pointed out, this is a knight's tour.
One sequence is Nc3-a2-c1-b3-a1-c2-a3-b1-d2-f3-h2-f1-e3-g2-e1-d3-b2-d1-f2-h3-g1-e2-g3-h1.
[FEN "8/8/8/8/8/pNnbPPpN/RBppPbrP/pkKPrqQR b - - 0 1"]

1... Nxa2 2. null Nxc1 3. null Nxb3 4. null Nxa1 5. null Nxc2 6. null Nxa3 7. null Nxb1 8. null Nxd2 9. null Nxf3 10. null Nxh2 11. null Nxf1 12. null Nxe3 13. null Nxg2 14. null Nxe1 15. null Nxd3 16. null Nxb2 17. null Nxd1 18. null Nxf2 19. null Nxh3 20. null Nxg1 21. null Nxe2 22. null Nxg3 23. null Nxh1

How did I create the sequence? I used Warnsdorff’s Rule:

Always move to an adjacent, unvisited square with minimal degree.

Where the degree is:

the number of unvisited squares that are adjacent to a given square

In the case of ties, I calculated ahead and made sure that the knight didn't get stuck.

13789: <pre><code>[FEN &quot;8/8/8/8/8/pNnbPPpN/RBppPbrP/pkKPrqQR b - - 0 1&quot;]
</code></pre>
<p>I was introduced to a challenge a few weeks ago with the above position. The challenge is to move the Black Knight such that it must always be three squares in the third row from the right, the point is to capture <em>all</em> pieces with the Black Knight. The order of the other pieces doesn't matter.</p>
<p>While an answer is awesome, what I'm mainly interested in is, is this really a thing?</p>
 -1: <p>As @Glorfindel pointed out, this is a knight's tour.</p>
<p>One sequence is Nc3-a2-c1-b3-a1-c2-a3-b1-d2-f3-h2-f1-e3-g2-e1-d3-b2-d1-f2-h3-g1-e2-g3-h1.</p>
<pre><code>[FEN &quot;8/8/8/8/8/pNnbPPpN/RBppPbrP/pkKPrqQR b - - 0 1&quot;]

1... Nxa2 2. null Nxc1 3. null Nxb3 4. null Nxa1 5. null Nxc2 6. null Nxa3 7. null Nxb1 8. null Nxd2 9. null Nxf3 10. null Nxh2 11. null Nxf1 12. null Nxe3 13. null Nxg2 14. null Nxe1 15. null Nxd3 16. null Nxb2 17. null Nxd1 18. null Nxf2 19. null Nxh3 20. null Nxg1 21. null Nxe2 22. null Nxg3 23. null Nxh1
</code></pre>
<p>How did I create the sequence? I used <a href="http://math.oregonstate.edu/%7Emath_reu/proceedings/REU_Proceedings/Proceedings2004/2004Ganzfried.pdf" rel="nofollow noreferrer">Warnsdorff’s Rule</a>:</p>
<blockquote>
<p>Always move to an adjacent, unvisited square with minimal degree.</p>
</blockquote>
<p>Where the degree is:</p>
<blockquote>
<p>the number of unvisited squares that are adjacent to a given square</p>
</blockquote>
<p>In the case of ties, I calculated ahead and made sure that the knight didn't get stuck.</p>
