This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the best known constraint programing algorithm is limited to T 40. The proposed approach relies on interesting properties which are used to constraint the search process.