Test with starting point at Exeter using default (linear) matching algorithm and cache size 30

Cache is built using a square with sides 20 km. User's path has steps of (2000, 2000) metres, with a total of 11 retrievals. Amount of look-ahead (both E and N) is 20km. Cache size is 30. (Size is set as a fixed value, derived from original size of 102).

Point furthest from the centre of cache (31200000, 11200000) is 3319834, 1085793; distance away is: 20.2054 kilometres.

Results for Exeter (OS 292,092) using default (linear) algorithm and 20 look-ahead
Threshold Total benchmark retrievals Retrievals lost
99% 27 24
98% 45 37
96% 142 82
93% 450 237

Default matching algorithm used was: (version pjb Jan 6b 2003) .

Commentary on this starting point: this may be a favourable case as the cache is centred on an area with lots of attractions, and the area outside the cache has fewer attractions.