Nearest-neighbors and id-tree codes both work with movie data.  I
split the movie data into train and test.  We can use each of the test
points for testing their code.  Their score can be based on how many
of the test points they get right.  If they get the class right or
they get the same classification as our implementation, then their
answer should be considered correct.