The shortest route from A to B is via a diagonal in the square, P . A to the north-west corner of the square P can be travelled from in 4! / 2! * 2! ways.
Number of ways to travel from the south-east corner of square P to B is 6!/4! * 2!.
B to the northeast corner of D can be traveled in 6!/5! ways.
From there to C can be traveled in 2 ways. There is 1 other way of travelling from B to C ( along the perimeter of the field )
The total number of ways is, therefore ( 4!/2!*2!) * (6!/4!*2!) * (6!/5! * 2+1) = 6*15*13 = 1170
therefore the correct answer is option A. 1170