Show that, without backtracking, $155$ nodes must be checked before the first solution to the n $=4$ instance of the n$-$Queens problem is found $($in contrast to the $27$ nodes in Figure $5\mathrm{.}4).$