BB+ wrote:BB+ wrote:Miguel came up with a different way of making his point, good enough that I will copy it here:
Just to make this more clear: I wrote that Fruit's PSTs could be derived from (and indeed
are derived from): a specific algorithmic process, an array of weights (like
-3 -1 0 1), and however many tunable parameters. What Miguel did (IMO) was point out that the array of weights could instead be embedded in the algorithmic process (via Taxicab considerations, and the like). I don't know whether it is worthwhile to debate which method has more/less "information content", as the process itself must be included in any such comparison. The most confusing thing I found about his presentation is that he doesn't specify the various linear relations between his variables, in the manner that both Rybka and Fruit have, and this can tend to an over-parametrisation of the system, particularly when comparing to other engines.
As I mentioned before, the alternative approach does not have more parameters. You need to count -3,-1,0,+1 as parameters. As you imply, I embedded that knowledge in the extra four parameters I used, ending up with the same number. In fact, with the knight tables, I used less parameters than Zach's code.
The point is not whether VR Rajlich used, Fruit code, my code, or Bob's code, which all of them produce the same numbers. The point is that the fact that there are real alternative ways to do this alerts us about something else. There is an underlying common knowledge that can be hardly "copyrightable". Namely, the secret is in the -3,-1,0,+1 vector.
That is
[0,1,2,3] + [-1,0,0,0] + [-2,-2,-2,-2] = [-3,-1,0,+1]
Blunt centralization ramp + edge penalty + normalization => final vector
There are many ways to end up with the allegedly magic [-3,-1,0,+1], which can ultimately be decomposed in rudimentary, non-unique, non-copyrightable chess knowledge. It is not a surprise that we find this in Crafty and Stockfish!
When I saw [-3,-1,0,+1] I immediately got the pattern and I figured the chess knowledge involved. That is why it was not so difficult to find a reasonable code alternative. Anybody who sees that pattern may or may not mentally decompose it, but I figure that if I show it with code, the people would get what I mean. I never expected to find an identical B table in Crafty, but I certainly expected to find it somewhere. Looks like Stockfish used it too (at least in the N tables and Q).
As you mentioned in a previous post, of course, all ways to come to the same numbers are related. But you also have to take into account that even Bishop, Queen, and Kind endgame tables from Fruit, can be derived from only one table, the Fruit Bishop table! How unique is this table? not much, we can find it in Crafty.
If Vas "copy" anything from the PSTs, it was something like this vector = [-3,-1,0,+1]. I cannot see how this could be an issue of copying and that is the point I am trying to make, not only that there are some alternatives. Other things such as the concept of diagonal bonus and backrank penalties should not be considered a problem (or trapped pieces in A8 etc.).
Miguel
I don't think this changes the conclusion about the PST evidence (which, as I say, never was even considered by the Panel). Namely, whether one views it an as array plus a process, or just an algorithmic process, what is being done is an encoding of some specific rendition of general chess knowledge (such as "centralisation"). There are relevant 11 PSTs, of which 8 of them have noticeable similarity in their renditions of this.