top of page

Exercise : Search and Recover Lost Operative

Jun 11
2 min read

Situation


The mathematical formula for finding the total number of shortest paths from one corner of a grid to another (moving only right and up) is calculated using a combinatorics formula: 



Where:

  • m = the number of steps to the right

  • n = the number of steps up

  • ! = factorial (such as: 4! = 4 x 3 x 2 x 1 )


To get from point A to point B on a standard grid, you must take an exact number of total moves (the shortest route). 


Grid Examples:


A route modelled as a 3 horizontal x 4 vertical mapped street block grid has 35 paths


...aye...!...

...if you/we model as that...

...

...mmmn...

...then...i would...!...

...be in like a jungle with zones...

...be the block size...

...mmmmmn...

...owhh...

...then may be...

...

..then what...!?...


-> NEED to drill the patrol to find a lost operative at an unknown location on the map


...owhh...!...


...then how can we find [ them ]...?...

- when the operative is "somewhere on the grid"...

...owhh…!...

...mmm...

..

...then like in a [ dense ] jungle...

[ where operatives are not visible below the canopy from aerial recon ]

...mmmn…

...or in [ the ] dark...

...the...

...

...

...on a sequence of [ jungle trail ] paths...

...would be...

...how long to cover them all...

...woooooh…!?…

...mmm...

...may get that in Taiwan...

[ total path number ]

...may be only one or two...[ in right ]

...and one... [ up ]…

...there could be "any number"...!...

...

...would be 10 and 2...

...we hack...

...and you...!...

...

...wha...!?...

...don't do it like that...

...then what...!?…

...

...it won't be [ a ] grid...

...wouldn't do it like that...!...?...

...

...what then...?...

...

...oh naysayer...

...do about give it in...!...

...

...hey...!!...

...

...

...[ it will ] be not unlikely...

...[ that ] we'll get told...

...go find someone lost in the jungle...

...

...mmm...

...on a trail ...

...between point A and B...

...



-> NEED to brief the team on the total number of path combinations which have to be searched


...permutations...

...

...do...

...be our map overlay...

...get familiar with the/their terrain...

...do...

...will...



-> NEED to estimate the expected time to complete the task and log the actual time required after

the task is finished...


...yes...

...then we get wise...

...at estimating...

...and use of time...!...

...mmmmn....!...


...

...

...now... this could take a while...

...you don't get that done in two...

...take more than three...

...

...if that....



 
 
 

Comments


bottom of page