Turtles all the way down

On the court, giants are identified as inverted stacks of marker cones. They can exist as a single marker cone, a double, or many, many more. 

Giants occupy the middle of spans connecting two locations. For a spy to travel along a span blocked by a giant they must make free throws equal to the number of marker cones in the stack. Defeating a single marker cone giant requires a single free throw to be made by the spy. If successful, the marker is removed from the court and the spy continues along the span to the destination. 

If the spy misses a free throw attempt the mage can  call for the ball in an effort to build up the blocking giant. In order to do this the mage removes a leap counter,  makes a successful free throw and moves a marker cone giant to to the disputed span, stacking the newly arrived giant atop the existing to form a single titan.

Following a spy missed free throw the mage can also withdraw the giant to a different span at a cost of a leap counter and made free throw. Why do this? Perhaps you want the spy to advance to a town and attempt a capture by arrow. 

In the illustration below, the spy has missed its free throw attempt and the mage has stepped up and made two consecutive free throws, moving  marker cone giants from W2 - W5 and P - E5, stacking them atop the blocking giant at W5 - B. The spy will now need to make 3 baskets from the free throw line in order to advance to W5. If the spy's turn ends before defeating the giant it will be forced to retreat to B. 

Using leap counters to stack multiple giants into one super giant boosts their usage and increases the value of a number of giant centered spells: Bildebig, Collosaleapea, Atlas Stacked, Fortify fo fum, and Thudika. 

It also provides an alternate spy fighting strategy; one of delay rather than capture by arrow. I think it is important to have decision points players can agonize over and while I think it would be a mistake to focus solely on creating the game's largest giant I applaud the mage who travels this path at least once. Let me know how it works out.

G.Walker