The kings prblems in semicomplete digraphs without vertices whose in-degree are zero and locally semicomplete digraph under some conditions are discussed chiefly in the paper.
A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of two mutually opposite arcs.