Turing House

Turing House Admissions Point

Our Admissions Point, shown as a brown star on the interactive map below, is in Somerset Gardens, near the Fulwell/Teddington border. It is central to the Middlesex side of the borough and chosen as the furthest point (2237m to be precise) from any other local co-ed non-faith secondary school. It is at the heart of an area that has been feeling an increasing local need for places of this type. Locating our Admissions Point at this central location gives some priority to families who have least priority for other mixed schools, and also helps to distribute our impact on other schools' admissions.

Our full admissions policy can be found here.  However, most of the places at Turing House School are allocated in distance order from both the Admissions Point and the planned permanent site of the school in Heathfield. The ratio of places is currently 80%:20%, but the size and shape of the admissions area that is generated depends on patterns of applications and preferences. It is influenced by local geography (e.g. the location of parks and rivers), and the relative popularity of other local schools. To help families understand their chances of admission we publish Allocation Maps for previous years - see our Admissions page for details. Also, the bar chart below shows our current distribution of students by ward.

Turing House governors are committed to striking an appropriate balance between serving the area closest to the school, and the broader area of need within the borough. We continuously monitor admissions patterns to ensure this aim is met. In doing so we consider the timing of our move to the permanent site, our potential impact on other schools, and the size of our Year 7 intake, which will increase when we move to our permanent site.

Turing House students by ward

The following chart represents the home locations of 450 current Turing House students in Year 7 to Year 10 as of October 2018.

How was the Admissions Point determined?

The Admissions Point was identified with Microsoft Excel Solver, using Linear Programming, an optimisation technique developed by a Russian contemporary of Alan Turing.

To put it simply, the algorithm tried many different British National Grid points within the polygon formed by all of the other mixed secondaries, until it found the point that was furthest from all of them.

Of course, we could have done the same thing by hand, with a map and a ruler, but it would have taken a very long time and probably would have been a lot less reliable! 


Turing House Badge