#ifndef KNIGHTSTOUR_H_ #define KNIGHTSTOUR_H_ /* Define boolean Values */ #define BTRUE 1 #define BFALSE 0 /* Define max. number of valid Jumps for a Knight */ #define MAX_VALID_JUMPS 8 /* Methods */ void initFieldCounter(); int solve(); int isUnsolvable(); void rJump(int position, int jumpCounter); int calcValidJumps(int position, int * array, int length); int getValidJumpsCount(int position); void updateFieldCounter(int * positions, int positionsLength, int skipPosition, int value); int inBounds(int x, int y); int toInteger(int x, int y); void toPosition(int val, int * x, int * y);#endif /*KNIGHTSTOUR_H_*/