Travelling sales problem

what does (1<<n)-1 do

it is a more efficient way to calculate power of 2^n

basically u are shifting 1 by n bits

1<<2
100 == 4

1<<4
10000= =16