FPGAs solve N=26 queens problem

While NQueens@Home is still working on it, the Queens@TUD project has solved the N=26 queens problem, that is, in how many different ways 26 queens can be placed on a chessboard without the possibility of capture among them. The solution is 22,317,699,616,364,044. Are local, "uncrowded" solutions faster after all? ;)