Probabilistic planning is of growing interest. Researchers formed international probabilistic planning competition (IPPC) from 2004. Every planner will hand out their best estimation in the competition. As the accuracy of the planner advances with times, we can assume most planners will be right in most cases. So given enough planners and times, we assume the action selected by majority is most likely to be the best. Hence we proposed a naive majority combination method for probabilistic planning in this paper. It simply uses the most selected action as the answer in every domain.