change log for P1069068 (close)
date | time | user | object | table | field | type | old | new |
---|---|---|---|---|---|---|---|---|
2019-11-30 | 21:13:01 | A.Buchanan | P1069068 | problems | comment | update | 2007 = C(3,1) * C(3,1) * (C(12,3) + 3) | chains: } [Sf3,e4>B~]>0-0>[Kh1,Re1>Re3]>Qg1>Bf1 } c4>Sc3>Rb1 B~ can't be e2. If B~ is d3, then the 9-chain & the 3 chain are independent, otherwise they concatenate C(3,1) * C(3,1) * (C(12,3) + 3) = 2007 |
2019-11-11 | 16:29:02 | A.Buchanan | P1069068 | problems | comment | update | 2007 = C(3,1) * C(3,1) * (C(12,3) + 1) | 2007 = C(3,1) * C(3,1) * (C(12,3) + 3) |
2017-09-22 | 7:19:19 | A.Buchanan | Fairies | refgen | add | |||
2012-12-26 | 8:25:53 | A.Buchanan | P1069068 | problems | comment | update | 2007 = C(3,1) * C(3,1) * (1 + C(12,3)) | 2007 = C(3,1) * C(3,1) * (C(12,3) + 1) |
2012-12-26 | 6:46:12 | A.Buchanan | P1069068 | problems | comment | update | 2007 = C(3,1) * C(3,1) * (1 + C(12,3)) | |
2012-12-26 | 5:56:38 | A.Buchanan | P1069068 | problems | soltxt | update | 2007 Lösungen | 2007 Lösungen! |
2012-09-05 | 2:54:57 | A.Buchanan | Fairies | refgen | remove | |||
2012-09-04 | 19:56:08 | A.Buchanan | P1069068 | problems | solution | update | 2007 Lösungen | |
2012-09-04 | 19:55:52 | A.Buchanan | P1069068 | problems | soltxt | update | 2007 Lösungen | |
2012-09-04 | 19:08:34 | A.Buchanan | Path enumeration (year) | refkey | addition | update | year | |
2012-06-30 | 11:31:21 | A.Buchanan | Path enumeration | refkey | add | |||
2012-06-30 | 11:31:01 | A.Buchanan | Non-Unique Proof Game | refkey | add | |||
2012-06-30 | 11:14:08 | A.Buchanan | Mathematics | refgen | add | |||
2012-06-30 | 11:14:08 | A.Buchanan | Fairies | refgen | add |