Measure partition problems are classical problems of geometric combinatorics ([1], [2], [3], [4]) whose solutions often use tools from the equivariant algebraic topology. The potential of the computational obstruction theory approach is partially demonstrated here. In this paper we reprove a result of V. V. Makeev [9] about a 6-equipartition of a measure on $S^2$ by three planes. The advantage of our approach is that it can be applied on other more complicated questions of the similar nature.