Mauricio wrote:I just learned a bit of javascript and decided to translate my C code for whips, here is the result

The computation times seem to be good.

Did you compute a mean js/C time ratio ?

As for the notation, you're missing the main point of the nrc notation: each {llc rlc} pair of candidates appearing in a chain can be factorised as 2D-cell{llc-value rlc-value}.

As shown in "Constraint Resolution Theories" (CRT), all the chain patterns I introduced in "The Hidden Logic of Sudoku" can be generalised to any (finite) Constraint Satisfaction Problem [If you don't have CRT, you can also find part of this on my website, in pdf versions of papers I published before it].

In this generalisation, the nrc notation for such pairs has a natural and straightforward extension as csp-variable{llc-value rlc-value}. [The 2D-cells appearing in the Extended Sudoku Board are graphical representations of its CSP-variables.]

As a result, splitting the rc, rn, cn or bn cells into two parts just for the sake of keeping the (n, r, c) order is meaningless.

I also noticed an inversion of llc and rlc in some {. something}.