[ List Earliest Comments Only For Pages | Games | Rated Pages | Rated Games | Subjects of Discussion ]
Check out Janggi (Korean Chess), our featured variant for December, 2024.
Check out Janggi (Korean Chess), our featured variant for December, 2024.
One quick side remark: Wikipedia pages have a 'history' tab, where you can see exactly who contributed what, over time. There also is a 'talk' tab, where you can see how several authors come to a concensus about issues, before they make modifications.
Indeed the empirical values of Man, Knight, or Ferfil found from computer games are roughly equal.
As you remark upon yourself, the formula you use for combining pieces cannot work both for combining two Quarter Knights to a Half Knight and for combining to Half Knights to a full Knight. So it must be obviously wrong in one of the cases, which means it can be wrong for some pieces, and thus could easily be wrong for all the pieces you applied it to. It is basically just a coincidence when it works. The problem is obviously that you add the same value of 1P all the time, irrespective of whether the combined moves actually cooperate well, or are sufficiently valuable to begin with.
I don't understand what you mean by a 'fully once colorbound Knight', and thus whether your conjecture that it is worth half a normal Knight makes any sense. A Ferfil has 8 moves and is color bound. Would that make it worth half a Knight? In practice a pair of (unlike) Ferfils is worth as much as a pair of Knights, on 8x8.
Why do you think that computer programs are weak? Can you easily beat them? Why do you think that the level of play matters anyway? Isn't it true that in a game between purely random movers the side with a Queen versus a Rook would already have a significant advantage, in terms of win rate?