nQueens Solution written with bitwise operators

101315-nQueens-bitwise.js

function N(n) {
    function Hack(R, e, a, c, t, o, r) {
        for (t = ~ (R | e | a) & c; t > 0;)
            t ^= o = t & -t, r += Hack(R | o, (e | o) >> 1, (a | o) << 1, c, 0, 0, 0);
        return R == c && r++, r
    }
    return Hack(0, 0, 0, (1 << n) - 1, 0, 0, 0)
};