GenNextMove(int depth)
{
   if(depth == nMaxMove)
   {
      nTotalPos++;
      return;
   }
   for(i = 0;i<nMoves;i++)
   {
        GenNextMove(depth+1);
   }
 
}
 
main(...)
{
    GenNextMove(0);
}

#include <stdio.h>
#include <stdlib.h>
 
int x, y = 0;
 
int endLocations = 0;
int maxJumps = 8;
 
void nextJump(int depth) {
 
	if(depth == maxJumps) {
		printf("Endposition (x,y) = (%d,%d)\n", x, y);
		endLocations++;
		return;
	}
 
	int i;
 
	for(i=1;i<3; i++) {
 
		switch(i) {
 
			case 1:
					x = x+3;
					y = y+1;
			case 2:
					x = x+2;
					y = y+3;
		}
		nextJump(depth+1);
	}
}
 
int main (int argc, char *argv[]) {
 
	nextJump(1);
	printf("Total endlocations: %d\n", endLocations);
 
	return 0;
}

#include <stdio.h>
#include <stdlib.h>
 
int endLocations = 0;
int routes = 0;
 
int xNew, yNew;
 
 
void nextJump(int depth, int x, int y, int xEnd, int yEnd, int totalMovesAllowed) {
 
	int xValue = x;
	int yValue = y;
 
	if(depth == totalMovesAllowed) {
		if(xValue == xEnd && yValue == yEnd)
			routes++;
		endLocations++;
		return;
	}
 
	int i;
 
	for(i=1;i<9; i++) {
 
		/** Represents all eight movements a Knight can make **/
		switch(i) {
 
			case 1:
					xNew = xValue+2;
					yNew = yValue+1;
					break;
			case 2:
					xNew = xValue+2;
					yNew = yValue-1;
					break;
			case 3:
					xNew = xValue-2;
					yNew = yValue+1;
					break;
			case 4:
					xNew = xValue-2;
					yNew = yValue-1;
					break;
			case 5:
					xNew = xValue+1;
					yNew = yValue+2;
					break;
			case 6:
					xNew = xValue+1;
					yNew = yValue-2;
					break;
			case 7:
					xNew = xValue-1;
					yNew = yValue+2;
					break;
			case 8:
					xNew = xValue-1;
					yNew = yValue-2;
					break;
		}
		nextJump(depth+1, xNew, yNew, xEnd, yEnd, totalMovesAllowed);
	}
}
 
int main (int argc, char *argv[]) {
 
	int xBegin, yBegin, xEnd, yEnd, totalMovesAllowed;
 
	printf("Check total amount of Knightjump routes\n");
	printf("Coordinates begin position: x y: ");
	scanf("%d %d", &xBegin, &yBegin);
	printf("Coordinates end position: x y : ");
	scanf("%d %d", &xEnd, &yEnd);
	printf("Number of allowed jumps: ");
	scanf("%d", &totalMovesAllowed);
 
	/** Check 1 for increased efficiency 
	this is a simple check, checking for the minimum distance that needs to be covered to even reach the end-spot
	**/
 
	int deltaX, deltaY, movesNeededX, movesNeededY, totalMovesNeeded;
	deltaX = xEnd-xBegin;
	deltaY = yEnd-yBegin;
 
	if(deltaX<0)
		deltaX = deltaX*-1;
	if(deltaY<0)
		deltaY = deltaY*-1;
 
	movesNeededX=deltaX/2;
	movesNeededY=deltaY/2;
 
	if(movesNeededX<1)
		movesNeededX=1;
	if(movesNeededY<1)
		movesNeededY=1;
 
	if(movesNeededX >= movesNeededY)
		totalMovesNeeded = movesNeededX+1;
	else
		totalMovesNeeded = movesNeededY+1;
 
	if(totalMovesAllowed >= totalMovesNeeded)
	{
 
		/** Check 2 for increased efficiency
		This check checks for the fact that a knight-move, on a black/white-square colored board
			will always move from black -> white or vice-versa.**/
 
		int beginSquare, endSquare;
 
		if((xBegin+yBegin)%2 != 0)
			beginSquare = 0;
		else
			beginSquare = 1;
		if((xEnd+yEnd)%2 != 0)
			endSquare = 0;
		else
			endSquare = 1;
 
		int difference = totalMovesAllowed%2;
 
		if(beginSquare == endSquare && difference == 0) {
			/** Checks passed - Call actual function **/
			nextJump(0,xBegin,yBegin, xEnd, yEnd, totalMovesAllowed);
		} else if(beginSquare == endSquare && difference != 0) {
			/* not possible -> do nothing */
		} else if(beginSquare != endSquare && difference == 0) {
			/*not possible -> do nothing */
		} else if(beginSquare != endSquare && difference != 0) {
			/** Checks passed - Call actual function **/
			nextJump(0,xBegin,yBegin, xEnd, yEnd, totalMovesAllowed);
		}
	}
	printf("\nTotal amount of routes: %d\n", routes);
 
	return 0;
}