![]() | Name | Last modified | Size | Description |
---|---|---|---|---|
![]() | Parent Directory | - | ||
![]() | out.zip | 2022-08-07 11:39 | 142K | |
![]() | README.html | 2022-08-07 11:54 | 968 | |
![]() | out/ | 2022-08-07 11:40 | - | |
See https://erich-friedman.github.io/mathmagic/unsolved.html
.. positions of 2 kinds of chess pieces, each of which the same number of the other piece but none of their own.
Is there a position where each bishop attacks 2 knights and each knight attacks 3 bishops? We abbreviate this as (B=2, N=3).
Here are all the unsolved cases: