A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is the out degree of the vertex. The Zagreb index of a tournament is defined as the sum of the squares of the scores of its vertices. In this paper, we obtain various lower and upper bounds for the Zagreb index of a tournament.