Assess students' ability to design an efficient, step-by-step algorithm using simple robot commands (e.g., move, pick, place, scan) to sort a mixed pile of colored blocks into matching color-coded bins. The task requires writing a clear command sequence that handles one block at a time, uses conditionals or loops where appropriate, minimizes the total number of moves, and explains why the sequence is correct and move-efficient given stated assumptions (bin locations, workspace limits).