change log for P1243429 (close)

datetimeuserobjecttablefieldtypeoldnew
2019-11-3019:35:38A.Buchanan P1243429 problems comment  updateProblem 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-227:23:20A.Buchanan Fairies refgen   add  
2012-12-268:31:50A.Buchanan P1243429 problems stip  updateHow many shortest sequences? Serienzug-BP in 14 Wieviele Lösungen? 
2012-12-268:29:02A.Buchanan P1243429 problems comment  updateProblem 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-265:57:37A.Buchanan P1243429 problems soltxt  update2005 solutions 2005 solutions! 
2012-09-052:55:15A.Buchanan Fairies refgen   remove  
2012-09-052:17:14A.Buchanan 7 The Electronic Journal of Combinatorics vol.11(2) 2004 refsrc   add  
2012-09-0419:58:41A.Buchanan P1243429 problems soltxt  update 2005 solutions 
2012-09-0419:58:15A.Buchanan P1243429 problems solution  update2005 solutions!  
2012-09-0419:24:56A.Buchanan Path enumeration (year) refkey addition  update year 
2012-09-0419:24:36A.Buchanan P1243429 problems solution  update 2005 solutions! 
2012-06-3016:23:21A.Buchanan P1243429 problems comment  update12/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-3014:51:24A.Buchanan Retro refgen   add  
2012-06-3014:51:06A.Buchanan Path enumeration refkey   add  
2012-06-3014:50:42A.Buchanan Series mover refkey   add  
2012-06-3014:50:24A.Buchanan Non-Unique Proof Game refkey   add  
2012-06-2920:47:20A.Buchanan wKh3 wDe4 wTh1c2 wLf1c1 wSg1a4 wBh2g2e2b2a2d3c3f4 position position  updateK S DB BB BBT B BB L LST  S DB BB KBBT B BB L LST 
2012-06-2920:46:43A.Buchanan Mathematics refgen   add  
2012-06-2920:46:43A.Buchanan Fairies refgen   add  
2012-06-2920:46:43A.Buchanan wKh6 wDe4 wTh1c2 wLf1c1 wSg1a4 wBh2g2e2b2a2d3c3f4 position   add  
2012-06-2920:46:43A.Buchanan Noam D. Elkies refaut   add  
2012-06-2920:46:43A.Buchanan P1243429 problems fcooked  update 
2012-06-2920:46:43A.Buchanan P1243429 problems cplus  update 
2012-06-2920:46:43A.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-2920:46:43A.Buchanan P1243429 problems stip  update How many shortest sequences? 
2012-06-2920:46:42A.Buchanan P1243429 problems   add