Author: José de Jesús García Ruvalcaba
Date: 09:59:36 08/15/99
Go up one level in this thread
On August 15, 1999 at 11:43:49, blass uri wrote: > >On August 15, 1999 at 10:32:49, KarinsDad wrote: > >>On August 15, 1999 at 00:32:54, blass uri wrote: >> >>[snip] >>> >>>This is not the only problem. >>>There are also many illegal positions but only the problem you mentioned worth >>>more than 18 bits. >>> >>>We can look at cases when every case is >>>64*63*...53*44*43*...*29 >>>if I assume white has 4 queens,4 rooks 4 bishops,4 knights >>>and black has 3 queens,3 rooks,3 bishops,3 knights >>>then you divide by 24*24*24*24*6*6*6*6 and it is more than 2^18 and even more >>>than 2^28 and in every case you devide by at least this number because numbers >>>like 5!*2! are bigger relative to 4!*3!. >>> >> >>Uri, >> >>I do not remember the number being that small. >> >>Could you post your algorithm again? >> >>Thanks, >> >>KarinsDad :) > >I think that I posted enough information. > >I published some articles in university about some mathematics counting problems >but professors in university did the job of writing the paper in english. >I know nobody in my university that is interested in problems about chess. >and I am not going to waste more time only to help other people to publish >papers without my name. > >Uri Do you mean that somebody else only translated your work and then published it as original, without giving you proper credit? José.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.