This paper addresses a tournament scoring problem that can lead to a score-based form of scheduling. Unlike classical combinatorial problems with some initial state and constraints, the problem is concerned with the construction of valid initial states according to some given final state and constraints and so it is named as reverse scheduling. Given a football tournament, this involves determining possible scores of all matches between teams, using the final state of the tournament table. For a feasible solution, the subject of multi-parameter partition is examined, the notion of black&white, graphs is introduced, and a rules-based method is proposed. Also, using some particular table data, experimental results are presented along with the number of different scores and their computation time for one team.