In this paper a league championship algorithm (LCA) is developed for structural optimization where the optimization variables are of discrete type and the set of the values possibly obtained by each variable is also given. LCA is a relatively new metaheuristic algorithm inspired from sport championship process. In LCA, each individual can choose to approach to or retreat from other individuals in the population. This makes it able to provide a good balance between exploration and exploitation tasks in course of the search. To check the suitability and effectiveness of LCA for structural optimization, five benchmark problems are adopted and the performance of LCA is investigated and deeply compared with other approaches. Numerical results indicate that the proposed LCA method is very promising for solving structural optimization problems with discrete variables.