This contribution proposes to unify pruning for affine merge candidates derivation. In ECM-6.0, two different pruning logics (denoted as A and B) are used for affine merge candidates derivation, which is asserted to complicate the affine prediction design. Two solutions are tested in this proposal. In solution #1, pruning in affine merge are unified to pruning logic A. In solution #2, pruning in affine merge are unified to logic B. Simulation results based on ECM-6.0 are reported as below: