Closed GoogleCodeExporter closed 9 years ago
Fixed in revision a06daa16c5.
Original comment by mattgatto
on 14 Oct 2010 at 4:26
Original comment by mattgatto
on 14 Oct 2010 at 4:28
The real question here is how we should handle fischer random castling moves
for positions like "br1b2kr/p3qppp/1p1ppnn1/1Pp5/2P1P3/1R1P1N2/P3QPPP/B1NB1RK1
b hb - 0 9" where the source and destination cord are the same for black's
castling move 0-0. Before the patch was applied, lmove.parseSAN converted "0-0"
to a Move == "g8g8", and with the patch applied, converts it to a Move ==
"g8h8", which simplifies generating hint arrows.
My question is, if we update lmovegen.genCastles (and testing/frc_castling.py)
to do the same thing and be consistent, will this break anything anywhere else
in the code, such as in the PyChess engine?
Original comment by mattgatto
on 14 Oct 2010 at 9:00
Attachments:
Matt, if updating lmovegen.genCastles doesn't fix further issues, I vote for
not updating it, because it's code is simple and compact now.
Original comment by gbtami
on 14 Oct 2010 at 12:54
Original issue reported on code.google.com by
mattgatto
on 14 Oct 2010 at 4:25Attachments: