Problem 4.7

A container is somebody who rides a leap stick and can jump starting with one square then onto the next without hitting any of different squares all the while (somewhat like a knight in chess). The capacity to get together speed and perform bigger leaps is accessible to them, yet their speed increase each move is limited, and they have a most extreme speed limitation. Containers is a game that is played on a rectangular lattice, with each square on the matrix being either empty or involved at any one time. Containers can fly over any space, yet they can just arrive on squares that are not involved by different players. A container has a speed (x,y) at each second on schedule, where x and y address the speed (in squares) of the container toward a path corresponding to the framework. Therefore, a speed of (2,1) relates to a knight jump (as does a speed of (- 2,1) and the other 6 rates).

To build up the quantity of bounces a container might do, we should initially choose how much speed a container can acquire or lose: either - 1, 0, or 1 square in one or the other or the two bearings in one or the other or the two headings. Subsequently, when running at speed (2,1), the container might move to speeds (1,0), (1,1), (1,2), (2,0), (2,1), (2,2), (3,0), (3,1), and (3,1) while running at speed (2,1). (3,2). Since it is inconceivable for the container to accomplish a speed of 4 one or the other way, the x and y parts will stay inside the scope of - 3 and 3, separately.

To finish the course when possible (i.e., in the least number of bounces), Containers should try not to arrive on any of the squares that have as of now been asserted by rivals. This task expects you to foster a program that, given a rectangular matrix, a beginning position S, and a completing point F, discovers how to go from S to F with the least measure of jumps as could be expected. A container starts with an underlying velocity of (0,0) and couldn't care less with regards to the speed at which it shows up to objective F when it shows up.

Particular for the info

The primary line of the program determines the quantity of experiments (N) that should be handled by the program.

In each experiment, the main line determines the width X (1 X 16) and tallness Y (1 Y 16) of the network, while the subsequent line indicates the length of the framework.

Then, there is a line containing four whole numbers isolated by spaces, of which the initial two demonstrate the beginning point (x1, y1) and the last two show the end point (x2, y2), where the beginning and end focuses are admirable statements on the network (that is, x1, y1) and where the beginning and end focuses are admirable statements on the framework (that is, 0 x1, y2 Y).

The third line of each experiment contains a number P, which demonstrates the quantity of obstructions in the network to be inspected.

At last, the experiment is comprised of P lines, every one of which determines an obstruction to survive.