Directional Tests
In this chapter, questions involve direction puzzles. Students are required to analyse the given information pertaining to the movement of persons, vehicles, etc., and find solutions to the given problems.
The adjacent figure shows the four main directions N, north; E, east; S, south and W, west and the four secondary directions NE, northeast; SE, southeast; SW, southwest and NW, northwest.
It is very important to remember the above directions while solving the problems.
The following chart indicates the direction in which a person would be moving, when he/she takes turn either towards left or towards right, from the original direction.
The direction in which a person is moving originally. 
The direction in which a person would be moving after taking a turn. 

Left turn 
Right turn 

North 
West 
East 
East 
North 
South 
West 
South 
North 
South 
East 
West 
Always indicate the path joining the initial and final position with a dotted line (). This is the shortest distance between the starting and the final point. Consider the distances to be in a straight line. Consider the turn (right or left) as 90Â° turn.
Some problems involve movement of persons, vehicles, etc., to several points (places), according to some specified instructions. Necessary care should be taken to properly analyse and understand correctly the direction of movement and the distance between the points (places).
Routes/networks connecting different places are given in some of the problems. The connectivity between two places can be either oneway or twoway.
If the statement is that there is oneway route from X to Y, then it can be represented as follows:
X Y
If the statement says that X and Y are connected by roads on which one can travel in either direction, it can be shown as follows:
X Y
Suppose the statement indicates that all the projected roads are oneway and there is a route from X to Y and also from Y to X, then it can be represented as follows:
X Y
X Y
From X to Y, there is one route; from Y to X, there is another route.
Now, let us understand the network in the adjacent diagram.
If a person starts from A and wants to reach B, how many possibilities exist?
He/she can travel from A to G and then from G to B. Another possibility is that he/she can travel from A to D, D to C, C to G and finally from G to B. Except these two routes there are no other possibilities. The two possibilities can be written as under:
 A G B
 A D C G B
Suppose the route between A and C is twoway and one wants to travel from A to F, the possible routes are as given below:
AGF, AGBF, ADCGF, ADCGBF, ACGF, ACGBF.
Thus, there are totally six distinct ways of reaching F from A.