A nearest-neighbor vote can end with equal class counts. This lesson shows an exact tied vote and names the required policy boundary.
Four nearest rows
This shown query uses k=4. The four displayed nearest rows have squared distances 1, 1, 4, and 4.
k=4,d2=[1,1,4,4]
The vote is tied
Among those neighbors, class A has 2 votes and class B has 2 votes. No class wins from the vote alone.
A:2,B:2
State the policy
Because the vote is tied, the displayed output is tie policy required. A class label would need a stated tie policy first.
output=tie policy required