Sports league scheduling problems have gained considerable amount of attention in recent years due to its huge applications and challenges. Traveling Tournament problem, proposed by Trick et. al. (2001), is a problem of scheduling round robin leagues which minimizes the total travel distance maintaining some constraints on consecutive home and away matches. No good algorithm is known to tackle this problem. Many issues including complexity of the problem is open. In this article we show that traveling tournament problem without the constraint of consecutive home and away matches is NP-hard. We hope our technique will be useful in proving the hardness of original TTP.