Comments/Ratings for a Single Item

~~Earlier~~ ⇧Reverse Order⇩ ~~Later~~

A could be interesting result about picket like limited sliders on a at least 12x12 board[Subject Thread] [Add Response]

Aurelian Florea wrote on Mon, May 20, 2019 12:30 PM UTC:

I have written a small c++ program that calculates the crowded board mobility (betza style : https://www.chessvariants.com/d.betza/pieceval/betterway.html).

For a future variant I have studied what I'd prefer for now to call 2-picket bishop and 2-picket rook. Meaning a bishop that moves at least three squares (has 2 long mandatory blind slides before) and a rook that does the same.

It seems that the 2-picket bishop is slightly stronger than a than a 2-picket rook 12x12 and I think I figured out why, but first I'm curious on other opinions. The results averaged over the board having between 10 and 84 pieces (so 75 different cases) are

2pb mobility: 4.52381

2pr mobility: 4.22735

Sure there is still the issue of colour boundness but for compund pieces it is quite an interesting observation, I think!...

H. G. Muller wrote on Mon, May 20, 2019 09:04 PM UTC:

I would think this is impossible. Diagonal moves of a certain length L have always lower average mobility than orthogonal moves of the same length: (S-L)*(S-L)/(S*S) instead of (S-L)/S, where S is the board size. They would get the same reduction factor because of board population, so blocking of moves doesn't alter that, no matter how you calculate it.

Aurelian Florea wrote on Tue, May 21, 2019 08:39 AM UTC:

Yes, I rethought it and it's probably a programming error!...

Aurelian Florea wrote on Tue, May 21, 2019 12:40 PM UTC:

@HG

Bug found!

I was adding a bishop ray twice!... Shame on me for not noticing!...

I guess this is how people sometimes find "faster than light" objects.

4 comments displayed

~~Earlier~~ ⇧Reverse Order⇩ ~~Later~~

Permalink to the exact comments currently displayed.