The author proposes that Move, as conceived as a special case of Merge, named internal Merge, under the Minimalist Program requires two prerequisite operations: one is to “dig” into a structure to find a target of Merge, called Search, and the other is to make this target reach the top of the structure, called Float.