IPL (Indian Premier League) tournament scheduling through backtrack approach

Abstract

IPL (Indian Premier League) tournament scheduling is proving the many combinations of the IPL tournament which is useful for the IPL members to get the schedule according to them. In this schedule we have at least two matches gap between previous and next matches for each and every team. Though this approach we will give some relaxations time to each and every team and then each team perform well in each match. IPL tournament schedules develop using backtracking approach which time complexity is define as an iterative backtracking, i.e. O (!n), where n ≥ 9. Backtrack approach has been used on those combinations whose pairs are not rearrange simply according to our given constrains, means we have applied iterative backtracking approach on remains pairs. It must be n*(n-1) pairs after rearrangement. If rearrangement is not completed n*(n-1) pairs then we have used backtracking approach. We use iterative backtracking methods with our constraint. This thesis comprise of 5 chapters, chapter 1 describes information