knight.c

// marciosdn
// v.2 - 2020-01-14 13:50

#include <stdio.h>
#include <string.h>

#define SIZEx 8
#define SIZEy 8

int Sx[] = { 2, 1,-1,-2,-2,-1, 1, 2};
int Sy[] = {-1,-2,-2,-1, 1, 2, 2, 1};
int T[SIZEx][SIZEy];    //Board x by y, zero filled.
int step = 1;
int sol = 1;    //Solutions.

void jump(int step, int x, int y) {
	if (!T[x][y]) {    //If 0, it can walk.
		T[x][y] = step++;
		if (step>SIZEx*SIZEy) {    //Is it finished, last step?
			printf("\nSolution: %d\n", sol++);
			printT();    //print it!
		} else {
			for(int k=0;k<8;k++)    //Try 8 directions.
			if (x+Sx[k]>-1 && y+Sy[k]>-1 && x+Sx[k]<SIZEx && y+Sy[k]<SIZEy)
			    jump(step,x+Sx[k],y+Sy[k]);    //go!
		}
		step--;
		T[x][y] = 0;
	}
}

void printT(void) {
	for(int i=0;i<SIZEx;i++) {
		for(int j=0;j<SIZEy;j++)
			printf(" %2d",T[i][j]);
		printf("\n");
	}
}

void main(void) {
	for(int i=0;i<SIZEx;i++) {
		for(int j=0;j<SIZEy;j++) {
			jump(step,i,j);
		}
	}
}