Assuming that "and" was supposed to be "any" (this is why proper spelling is important, folks), this is entirely false. Any sequence of turns solves one and only one position of the cube. If you don't believe it, work on your spatial reasoning imagine taking a solved cube and performing the inverse of the sequence (the sequence in reverse order, with all clockwise turns becoming counterclockwise and vise versa). You will get one position (obviously a starting position plus a sequence of turns uniquely determines an ending position). This is the position that that sequence will solve. No other.
Blindfold solving is done by memorizing the starting configuration of the cube and then performing algorithms that only affect a small number of pieces in a specific way (e.g. rotating three corners clockwise, flipping the orientation of two edges). These algorithms can be combined to, for example, cycle edge A -> edge B -> edge C -> edge D -> edge E -> edge A. Because this is inefficient from a number of turns standpoint, it wouldn't be suitable for a robot.