![]() Then I tried to put things in around her. I put baby the queen in the corner to attempt to reduce the directions of her influence. Anything else I try ends up with at least one piece attacking multiple other pieces, and I still can't get all the pieces on the board without several of these multiple attacks. However, there's a single cycle from Ra3 to d6. Maybe someone can work off this and do better. It's missing a pawn on c and a bishop on the black diagonal, and the pawn on d doesn't attack anything, as well as nothing attacks the rook on a3, but this is as close as I can apparently get. All we need to do is rip out the f file but relax we are putting it right back: as the new i file. We can actually achieve a full solution with no doubled pawns by ever so slightly bending the rules. If we lift the one pawn per file rule it becomes untractable for my computer program, but we can solve manually Using these constraints makes the code rather verbose and ugly but keeps the number of candidates below a million or so. There are at least two Ps on the same rank and their respective chains cannot be both capped by Rs because then 1 chain would have to cross the private rank of the other chains R. At least 1 chain of Ps must be capped off by a N.The Q, in particular, must also have her diagonals to herself. That is because there is at least a P on their file, so they must spend their attack on that file. The major pieces each have a rank to themselves.That is because Ps can only attack other Ps or Rs or Ns and each separate chain has a P at the base that is not available to be attacked by another P. There are no more than 4 chains of Ps.įrom the assumptions follow a handful of constraints that enable an exhaustive search. It finds essentially three such solutions plus a few minor variations. The best my computer finds is two cycles. ![]() If there is nothing wrong with my rather spaghettoid script (admittedly, a big if) then there is no complete solution. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |