change log for P1243525 (close)
date | time | user | object | table | field | type | old | new |
---|---|---|---|---|---|---|---|---|
2012-09-05 | 2:12:45 | A.Buchanan | 5 The Electronic Journal of Combinatorics vol.11(2) 2004 | refsrc | add | |||
2012-09-04 | 19:41:34 | A.Buchanan | Fairies | refgen | remove | |||
2012-09-04 | 19:38:49 | A.Buchanan | Conditional problem | refkey | add | |||
2012-09-04 | 18:50:07 | A.Buchanan | Path enumeration (Fibonacci) | refkey | addition | update | Fibonacci | |
2012-06-30 | 17:42:30 | A.Buchanan | P1243525 | problems | comment | update | Problem 5 original: N.D.Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. edit | Problem 5 original: N.D.Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. |
2012-06-30 | 16:55:49 | A.Buchanan | P1243525 | problems | stip | update | Mate in (exactly) n: how many solutions? | Mate in (exactly) n: how many solutions? [Composer excludes draw by repetition & 50 move.] |
2012-06-30 | 16:55:13 | A.Buchanan | P1243525 | problems | soltxt | update | composer's solution: 2^F_n, where F_n is the nth Fibonacci number (1,1,2,3,5,8,13...) Noam warns that his solution may be "controversial". Basically for fixed n, there are F_n different sequences for Black, and White is asked to find a response for each of these. But it can be argued that White should just respond to the position, not to irrelevant history, particularly in a format in which the composer explicitly excluded draw by repetition & 50 move from consideration. | |
2012-06-30 | 16:43:26 | A.Buchanan | wKa1 wTa8 wLc1 wSb8 wBd2b2g5f6c6h7a7 sKc8 sSh8 sBd3b3g6f7c7 | position | piecesw | update | 10 | 11 |
2012-06-30 | 16:43:26 | A.Buchanan | wKa1 wTa8 wLc1 wSb8 wBd2b2g5f6c6h7a7 sKc8 sSh8 sBd3b3g6f7c7 | position | position | update | TSk sB b b B B b B b b B B K L | TSk sB b b B B Bb B b b B B K L |
2012-06-30 | 16:42:45 | A.Buchanan | wKa1 wTa8 wLc1 wSb8 wBd2b2f5c6h7a7 sKc8 sSh8 sBd3b3g6f7c7 | position | piecesw | update | 11 | 10 |
2012-06-30 | 16:42:45 | A.Buchanan | wKa1 wTa8 wLc1 wSb8 wBd2b2f5c6h7a7 sKc8 sSh8 sBd3b3g6f7c7 | position | position | update | TSk sB b bB B B b B b b B B K L | TSk sB b b B B b B b b B B K L |
2012-06-30 | 16:41:35 | A.Buchanan | Mathematics | refgen | add | |||
2012-06-30 | 16:41:35 | A.Buchanan | Fairies | refgen | add | |||
2012-06-30 | 16:41:35 | A.Buchanan | n# | refgen | add | |||
2012-06-30 | 16:41:35 | A.Buchanan | Path enumeration | refkey | add | |||
2012-06-30 | 16:41:35 | A.Buchanan | wKa1 wTa8 wLc1 wSb8 wBd2b2f5e6c6g7a7 sKc8 sSh8 sBd3b3g6f7c7 | position | add | |||
2012-06-30 | 16:41:35 | A.Buchanan | Noam D. Elkies | refaut | add | |||
2012-06-30 | 16:41:35 | A.Buchanan | P1243525 | problems | fcooked | update | F | |
2012-06-30 | 16:41:35 | A.Buchanan | P1243525 | problems | cplus | update | F | |
2012-06-30 | 16:41:35 | A.Buchanan | P1243525 | problems | comment | update | Problem 5 original: N.D.Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. edit | |
2012-06-30 | 16:41:35 | A.Buchanan | P1243525 | problems | stip | update | Mate in (exactly) n: how many solutions? | |
2012-06-30 | 16:41:34 | A.Buchanan | P1243525 | problems | add |