change log for P1243429 (close)
date | time | user | object | table | field | type | old | new |
---|---|---|---|---|---|---|---|---|
2019-11-30 | 19:35:38 | A.Buchanan | P1243429 | problems | comment | update | Problem 7 original: N.D.Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. 2005 = 2 * C(14,4) + 3 | Problem 7 original: N.D.Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. There are two chains: }Sc3>Sa4>c3>Qc2>Qe4>d3>B~>Rc1>Rc2>Bc1 }f4>Kf2>Kg3>Kh3 Whether these interact depends upon the destination of the switchback wQB. d2 & e3 mean that the two chains are independent, while f4, g5 & h6 mean a single 14-chain. Hence: 2*C(14,4) + 3 = 2005 |
2017-09-22 | 7:23:20 | A.Buchanan | Fairies | refgen | add | |||
2012-12-26 | 8:31:50 | A.Buchanan | P1243429 | problems | stip | update | How many shortest sequences? | Serienzug-BP in 14 Wieviele Lösungen? |
2012-12-26 | 8:29:02 | A.Buchanan | P1243429 | problems | comment | update | Problem 7 original: N.D.Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. | Problem 7 original: N.D.Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. 2005 = 2 * C(14,4) + 3 |
2012-12-26 | 5:57:37 | A.Buchanan | P1243429 | problems | soltxt | update | 2005 solutions | 2005 solutions! |
2012-09-05 | 2:55:15 | A.Buchanan | Fairies | refgen | remove | |||
2012-09-05 | 2:17:14 | A.Buchanan | 7 The Electronic Journal of Combinatorics vol.11(2) 2004 | refsrc | add | |||
2012-09-04 | 19:58:41 | A.Buchanan | P1243429 | problems | soltxt | update | 2005 solutions | |
2012-09-04 | 19:58:15 | A.Buchanan | P1243429 | problems | solution | update | 2005 solutions! | |
2012-09-04 | 19:24:56 | A.Buchanan | Path enumeration (year) | refkey | addition | update | year | |
2012-09-04 | 19:24:36 | A.Buchanan | P1243429 | problems | solution | update | 2005 solutions! | |
2012-06-30 | 16:23:21 | A.Buchanan | P1243429 | problems | comment | update | 12/2004 N. D. Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. | Problem 7 original: N.D.Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. |
2012-06-30 | 14:51:24 | A.Buchanan | Retro | refgen | add | |||
2012-06-30 | 14:51:06 | A.Buchanan | Path enumeration | refkey | add | |||
2012-06-30 | 14:50:42 | A.Buchanan | Series mover | refkey | add | |||
2012-06-30 | 14:50:24 | A.Buchanan | Non-Unique Proof Game | refkey | add | |||
2012-06-29 | 20:47:20 | A.Buchanan | wKh3 wDe4 wTh1c2 wLf1c1 wSg1a4 wBh2g2e2b2a2d3c3f4 | position | position | update | K S DB BB BBT B BB L LST | S DB BB KBBT B BB L LST |
2012-06-29 | 20:46:43 | A.Buchanan | Mathematics | refgen | add | |||
2012-06-29 | 20:46:43 | A.Buchanan | Fairies | refgen | add | |||
2012-06-29 | 20:46:43 | A.Buchanan | wKh6 wDe4 wTh1c2 wLf1c1 wSg1a4 wBh2g2e2b2a2d3c3f4 | position | add | |||
2012-06-29 | 20:46:43 | A.Buchanan | Noam D. Elkies | refaut | add | |||
2012-06-29 | 20:46:43 | A.Buchanan | P1243429 | problems | fcooked | update | F | |
2012-06-29 | 20:46:43 | A.Buchanan | P1243429 | problems | cplus | update | F | |
2012-06-29 | 20:46:43 | A.Buchanan | P1243429 | problems | comment | update | 12/2004 N. D. Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. | |
2012-06-29 | 20:46:43 | A.Buchanan | P1243429 | problems | stip | update | How many shortest sequences? | |
2012-06-29 | 20:46:42 | A.Buchanan | P1243429 | problems | add |