hello so this is a long code whit multypule files so i will try to explain:
this is a porject nad this is my q3: make A func that returns a tree that symblosie all the possible moves a knight can take whit out stepping on the same sqaure twice(so it wont be infinit).