change log for P1243426 (close)
| date | time | user | object | table | field | type | old | new |
|---|---|---|---|---|---|---|---|---|
| 2021-08-06 | 12:51:15 | A.Buchanan | P1243426 | problems | cplus | update | F | T |
| 2021-08-06 | 12:51:15 | A.Buchanan | P1243426 | problems | cpluscomm | update | Jacobi v.0.6 | |
| 2021-08-06 | 12:47:28 | A.Buchanan | P1243426 | problems | stip | update | BP in 10 Wieviele Lösungen? | KBP Wieviele Lösungen? |
| 2021-08-06 | 12:12:07 | A.Buchanan | P1243426 | problems | solution | update | 1. b3 a5 2. La3 b5 3. Lb4 c5 4. Sa3 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Dd2 cxb4# is one example | 1. b3 a5 2. La3 b5 3. Lb4 c5 4. Sa3 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Db2 cxb4# is one example |
| 2021-08-06 | 12:11:52 | A.Buchanan | P1243426 | problems | solution | update | 1. b3 a5 2. La3 b5 3. Lb4 c5 4. Sa3 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Qd2 cxb4# is one example | 1. b3 a5 2. La3 b5 3. Lb4 c5 4. Sa3 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Dd2 cxb4# is one example |
| 2021-08-06 | 12:11:32 | A.Buchanan | P1243426 | problems | solution | update | 1. b3 a5 2. La3 b5 3. Lb4 c5 4. Sa6 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Qd2 cxb4# is one example | 1. b3 a5 2. La3 b5 3. Lb4 c5 4. Sa3 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Qd2 cxb4# is one example |
| 2021-08-06 | 12:11:16 | A.Buchanan | P1243426 | problems | solution | update | 1. b6 a5 2. La3 b5 3. Lb4 c5 4. Sa6 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Qd2 cxb4# is one example | 1. b3 a5 2. La3 b5 3. Lb4 c5 4. Sa6 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Qd2 cxb4# is one example |
| 2021-08-06 | 12:02:14 | A.Buchanan | P1243426 | problems | stip | update | BP in 10.0 How many solutions? | BP in 10 Wieviele Lösungen? |
| 2021-08-06 | 12:01:19 | A.Buchanan | P1243426 | problems | stip | update | KBP How many solutions? | BP in 10.0 How many solutions? |
| 2021-08-06 | 11:59:53 | A.Buchanan | P1243426 | problems | solution | update | 1. b6 a5 2. La3 b5 3. Lb4 c5 4. Sa6 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Qd2 cxb4# | 1. b6 a5 2. La3 b5 3. Lb4 c5 4. Sa6 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Qd2 cxb4# is one example |
| 2021-08-06 | 11:59:40 | A.Buchanan | P1243426 | problems | solution | update | E.g. 1. b6 a5 2. La3 b5 3. Lb4 c5 4. Sa6 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Qd2 cxb4# | 1. b6 a5 2. La3 b5 3. Lb4 c5 4. Sa6 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Qd2 cxb4# |
| 2021-08-06 | 11:59:22 | A.Buchanan | P1243426 | problems | stip | update | SPG How many solutions? | KBP How many solutions? |
| 2021-08-06 | 11:58:58 | A.Buchanan | P1243426 | problems | stip | update | How many shortest proof games? | SPG How many solutions? |
| 2021-08-06 | 11:58:24 | A.Buchanan | P1243426 | problems | stip | update | How many shortest games? | How many shortest proof games? |
| 2021-08-06 | 11:57:54 | A.Buchanan | P1243426 | problems | solution | update | E.g. 1. b6 a5 2. La3 b5 3. Lb4 c5 4. Sa6 e5 5. Db1 Ta7 6. Kd1 La6 7. Kc1 Db6 8. Kb2 Ke7 9. Kc3 e4 10. Qd2 cxb4# | |
| 2021-08-06 | 11:56:29 | A.Buchanan | P1243426 | problems | soltxt | update | Euler number, E_n, defined by generating function: sec(x) + tan(x) = Sum(n=0...infinity) E_n (x^n/n!) Here E_9 = 7,936. | Black has just played cxLb5#. White moves are 1. b6 2. La3 3. Lb4 4. Sa6 5. Db1 6. Kd1 7. Kc1 8. Kb2 9. Kc3 10. Qd2. So from W2, wLc was potentially checking e7, unless blocked by sBc5. This fact allows us to complete the zigzag ordering of first 9 Bl moves Ta7 > a5 < La6 > b5 < Db6 > c5 < Ke7 > e5 < e4. There are E_9 possible orderings of these 9 moves, where the Euler number, E_n, is defined by generating function: sec(x) + tan(x) = Sum(n=0...infinity) E_n (x^n/n!). Here E_9 = 7,936 |
| 2019-11-11 | 13:52:22 | A.Buchanan | Retro | refgen | add | |||
| 2012-09-05 | 2:23:43 | A.Buchanan | 1 The Electronic Journal of Combinatorics vol.11(2) 2004 | refsrc | remove | |||
| 2012-09-05 | 2:20:49 | A.Buchanan | 1 The Electronic Journal of Combinatorics vol.11(2) 2004 | refsrc | add | |||
| 2012-09-05 | 2:20:05 | A.Buchanan | 1 The Electronic Journal of Combinatorics vol.11(2) 2004 | refsrc | add | |||
| 2012-09-04 | 20:03:44 | A.Buchanan | P1243426 | problems | soltxt | update | Euler number, E_n, defined by generating function: sec(x) + tan(x) = Sum(n=0...infinity) E_n (x^n/n!) Here E_9 = 7936. | Euler number, E_n, defined by generating function: sec(x) + tan(x) = Sum(n=0...infinity) E_n (x^n/n!) Here E_9 = 7,936. |
| 2012-09-04 | 19:52:55 | A.Buchanan | Path enumeration (Euler) | refkey | addition | update | Euler | |
| 2012-06-30 | 14:50:04 | A.Buchanan | Non-Unique Proof Game | refkey | add | |||
| 2012-06-30 | 14:48:29 | A.Buchanan | Path enumeration | refkey | add | |||
| 2012-06-30 | 5:35:04 | A.Buchanan | P1243426 | problems | soltxt | update | Euler number, E_n, defined by generating function: sec(x) + tan(x) = Sum(n=0...infinity) E_n (x^n/n!) Here E_9 = 7936. | |
| 2012-06-30 | 5:26:50 | A.Buchanan | wKc3 wDb2 wTh1a1 wLf1 wSg1a3 wBh2g2f2e2d2c2a2b3 sKe7 sDb6 sTa7h8 sLa6f8 sSg8b8 sBe4b4b5a5h7g7f7d7 | position | piecesb | update | 15 | 16 |
| 2012-06-30 | 5:26:50 | A.Buchanan | wKc3 wDb2 wTh1a1 wLf1 wSg1a3 wBh2g2f2e2d2c2a2b3 sKe7 sDb6 sTa7h8 sLa6f8 sSg8b8 sBe4b4b5a5h7g7f7d7 | position | piecesw | update | 16 | 15 |
| 2012-06-30 | 5:26:50 | A.Buchanan | wKc3 wDb2 wTh1a1 wLf1 wSg1a3 wBh2g2f2e2d2c2a2b3 sKe7 sDb6 sTa7h8 sLa6f8 sSg8b8 sBe4b4b5a5h7g7f7d7 | position | position | update | s lstt bBbbbld bb b b SBK BDBBBBBBT LST | s lstt bkbbbld bb b b SBK BDBBBBBBT LST |
| 2012-06-30 | 5:25:57 | A.Buchanan | P1243426 | problems | comment | update | 2004 N. D. Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. | Problem 1 original: N.D.Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. |
| 2012-06-29 | 20:27:48 | A.Buchanan | wKc3 wDb2 wTh1a1 wLf1 wSg1a3 wBh2g2f2e2d2c2a2b3e7 sDb6 sTa7h8 sLa6f8 sSg8b8 sBe4b4b5a5h7g7f7d7 | position | piecesb | update | 16 | 15 |
| 2012-06-29 | 20:27:48 | A.Buchanan | wKc3 wDb2 wTh1a1 wLf1 wSg1a3 wBh2g2f2e2d2c2a2b3e7 sDb6 sTa7h8 sLa6f8 sSg8b8 sBe4b4b5a5h7g7f7d7 | position | piecesw | update | 7 | 16 |
| 2012-06-29 | 20:27:48 | A.Buchanan | wKc3 wDb2 wTh1a1 wLf1 wSg1a3 wBh2g2f2e2d2c2a2b3e7 sDb6 sTa7h8 sLa6f8 sSg8b8 sBe4b4b5a5h7g7f7d7 | position | position | update | s lstt bkbbbld bb b b S K D T LST | s lstt bBbbbld bb b b SBK BDBBBBBBT LST |
| 2012-06-29 | 20:25:38 | A.Buchanan | Mathematics | refgen | add | |||
| 2012-06-29 | 20:25:38 | A.Buchanan | wKc3 wDb2 wTh1a1 wLf1 wSg1a3 sKe7 sDb6 sTa7h8 sLa6f8 sSg8b8 sBe4b4b5a5h7g7f7d7 | position | add | |||
| 2012-06-29 | 20:25:37 | A.Buchanan | Noam D. Elkies | refaut | add | |||
| 2012-06-29 | 20:25:37 | A.Buchanan | P1243426 | problems | fcooked | update | F | |
| 2012-06-29 | 20:25:37 | A.Buchanan | P1243426 | problems | cplus | update | F | |
| 2012-06-29 | 20:25:37 | A.Buchanan | P1243426 | problems | comment | update | 2004 N. D. Elkies, New Directions in Enumerative Chess Problems, The Electronic Journal of Combinatorics, vol. 11(2), 2004. | |
| 2012-06-29 | 20:25:37 | A.Buchanan | P1243426 | problems | stip | update | How many shortest games? | |
| 2012-06-29 | 20:25:37 | A.Buchanan | P1243426 | problems | add |