Enter Your Reply

Http://en.wikipedia.org/wiki/Shannon_number -- it can be demonstrated that the number of cvs far, far exceed the Shannon number and the number of piece-types potentially do too. This is part of computer science and ought to develop for cvs as well.
Here before latin scientific names intruded into CVPage,
http://www.chessvariants.org/index/displaycomment.php?commentid=18396. That excercise got up to number of CVs clearly identifiable having complete rules equal to number of atoms in the Solar system, 10^57, callable on demand. For example, CV#3,254,355,999 -- here it is or would be among the running total up to 10^57 so far. The mere running total of 10^57 happens to be over ''halfway'' by orders of magnitude to number of atoms in universe; that second half is not yet completed to get #CVs equal number atoms in universe, 10^80, but easily attainable by only another 33 good mutators superimposed on the method.  Much the same could be done for piece-types themselves alone by generating them formulaically beyond, say, convenient M&Bxx's less than 10,000 to ten million and more. Thus logically CVs and CV piece-types are easy as pi. Http://www.mayhematics.com/v/gm.htm -- as Jeremy Lennert points out, Panda is Parton's Slip-Rook. From around 1960 Panda is Rook that must change colour each turn; see M&B06.
So there are mentioned already 3.0-Rooks-downsized, call them B-Rooks, four new Water, Land, Green, and Yellow and one ancient Parton Panda.
Http://www.madsci.org/posts/archives/1998-05/892502124.Ph.r.html.