OK so that got your attention!

imagine a 4x4 grid containing letters A to P

starting a any square on the grid move to another square
you may move to anysquare as long as it hasn't been used already in this string of moves.

How many combinations are there?

Code:
ABCD
EFGH
IJKL
MNOP
Starting a A we can then have B, F or E
and so on

Code:
		C
		G
	B----->	F
		E

		B
		C
		G
A ---> 	F---->	K
		J
		I
		E

		B
		F
	E---->	J
		I