Controllability of higher order switched Boolean control networks (SBCNs) is investigated in this paper. Two algebraic forms of higher order SBCNs are derived. A necessary and sufficient condition of controllability for higher order SBCNs is obtained. An algorithm is derived to calculate the corresponding control and switching-law which drive a point to a given reachable point. Then we talk about the compatibility between our main results and other systems. Finally, two illustrative examples are given to show the validity of the main results.