2 replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/

Python, 38 bytes

f=lambda h,*t:t==()or 7>h^t[0]>0<f(*t)


A recursive function that takes arguments like f(1,2,3).

This makes use of argument unpacking to extract the first number into h and the rest into the tuple t. If t is empty, output True. Otherwise, use Zgarb's bit trickZgarb's bit trick to check that the first two die rolls are not incompatible. Then, check that the result also holds on the recursive call on the tail.

Python, 38 bytes

f=lambda h,*t:t==()or 7>h^t[0]>0<f(*t)


A recursive function that takes arguments like f(1,2,3).

This makes use of argument unpacking to extract the first number into h and the rest into the tuple t. If t is empty, output True. Otherwise, use Zgarb's bit trick to check that the first two die rolls are not incompatible. Then, check that the result also holds on the recursive call on the tail.

Python, 38 bytes

f=lambda h,*t:t==()or 7>h^t[0]>0<f(*t)


A recursive function that takes arguments like f(1,2,3).

This makes use of argument unpacking to extract the first number into h and the rest into the tuple t. If t is empty, output True. Otherwise, use Zgarb's bit trick to check that the first two die rolls are not incompatible. Then, check that the result also holds on the recursive call on the tail.

1

Python, 38 bytes

f=lambda h,*t:t==()or 7>h^t[0]>0<f(*t)


A recursive function that takes arguments like f(1,2,3).

This makes use of argument unpacking to extract the first number into h and the rest into the tuple t. If t is empty, output True. Otherwise, use Zgarb's bit trick to check that the first two die rolls are not incompatible. Then, check that the result also holds on the recursive call on the tail.