Two passes.
One computer-generated order.
PIA first works through everyone’s first choice. Only then does it return to applicants who still need a place.
First choices only.
Work from the highest computer-generated rank to the lowest. Give each applicant their first school if it has space. If it is full, skip that applicant for now.
Finish the entire applicant list.Return to those still waiting.
Start again in exactly the same rank order. For each unplaced applicant, go down their preference list until a school with space is found.
Place that applicant before moving to the next.Why the second pass matters.
Three applicants, three schools, one place in each. The computer-generated order is Ada, then Ben, then Cy.
| Applicant / rank order | Preferences | Pass 1 | Pass 2 |
|---|---|---|---|
| Ada · 1 | A → B → C | School A | Already allocated |
| Ben · 2 | A → B → C | A is full; wait | School C · 3rd preference |
| Cy · 3 | B → C → A | School B | Already allocated |
What does your rank mean?
It determines the order in which the algorithm considers applicants. It is not based on academic performance. The same rank is retained for group and programme matching. For FP2027, UKFPO says ranks will be released after recruitment ends to applicants still allocated at release; others can request theirs. It is not an input applicants know while making preferences.
What this example leaves out
Linked pairs need two available places and use the lower-ranked partner; a broken link can cause the process to restart. Pre-allocation, manual SFP placements and reserve-list admission are separate concerns. This MVP does not simulate those routes.
Read the official FP2027 allocation guidance ↗ · FP2027 changes and rank release ↗