delete [all v] of [liste2 v]
repeat until < ( length of [liste1 v] :: list) < [1] >
set ( i) to (pick random (1) to (length of [liste1 v]))
add (item (i) of [liste1 v]) to [liste2 v]
delete ( i) of [liste1 v]
end

set (l) to (length of [liste v] :: list)
set (i) to (pick random [1] to (l))
set (iv) to (item (i) of [liste  v])
repeat ([2]*(l))
    set (j) to (pick random [1] to (l))
    set (item (i) of [liste  v]) to (item (j) of [liste  v])
    set (i) to (j)
end
set (item (j) of [liste  v]) to (iv)

Mick456 wrote:

How do you make it so that the program shuffles a list without repeating any existing values (e.g. You becomes Yuu)?

define Shuffle
set [each v] to [0]
repeat ((length of [cards v]) - (1))
    change [each v] by (1)
    Swap (each) (pick random (each) to (length of [cards v]))
end