Search found 72 matches

by SMIRF
Wed Apr 08, 2015 9:01 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Invalid fen
Replies: 33
Views: 6750

Re: Invalid fen

Indeed, you are right. There something seems to be wrong with my new move generator. My old SMIRF generated: FEN: rrrrkr1R/rr1rr3/8/8/8/8/8/6K1 b kq - 0 5 =>+-*--b--c--d--*--*--g--h-+ Embarcadero RAD Pro C++ 32-Bit-Vers. 6.90 8 |[r][r][r][r][k][r] <R>| (Compilation: Apr 8 2015) 7 |[r][r]:::[...
by SMIRF
Tue Apr 07, 2015 5:19 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Invalid fen
Replies: 33
Views: 6750

Re: Invalid fen

there only could be two active castling columns (see '*' marks), e.g.: XFEN 00: rrrrkr1R/rr1rr3/8/8/8/8/8/6K1 b kq - 0 1 (b)+-*--b--c--d--*--*--g--h-+ 8 |[r][r][r][r][k][r] <R>| Compiled on Apr 7 2015 7 |[r][r]:::[r][r] ::: | MS Vis.Studio C/C++ 64-Bit Vers. 18.0 6 | ::: ::: ::: :::| 5 |::: ...
by SMIRF
Wed Apr 01, 2015 7:12 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Invalid fen
Replies: 33
Views: 6750

Re: Invalid fen

SMIRF has tried to avoid misinterpretations by visualizing castling rights using black spots near castling enabled pieces:

Image
by SMIRF
Mon Mar 09, 2015 11:53 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: just for the fun
Replies: 5
Views: 1274

Re: just for the fun

It is interesting to find out, how far one can go without copying foreign sources, when trying to realize a view based data structure using merely achromatic pieces.
by SMIRF
Sat Feb 28, 2015 10:10 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: How to test quiescence search quality?
Replies: 3
Views: 1058

Re: How to test quiescence search quality?

Well I see, that modifying and testing of quiescence search will not make much sense, before a usable evaluation function is implemented. When I have added a simple king savety component, I already got: XFEN 0: 3q2R1/2P5/1k1B4/4np2/1NPK1Pr1/1R6/PP1N1Q2/3q2b1 w - - 0 123 +-a--b--c--d--e--f--g--h-+ 8 ...
by SMIRF
Thu Feb 26, 2015 12:30 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: How to test quiescence search quality?
Replies: 3
Views: 1058

How to test quiescence search quality?

Having only a very weak evaluation yet, I am about to verify / optimize my quiescence search, move sorting, and killer heuristic. I have some test positions, to which I evaluate all possible moves by unshrinked quiescence and count every call of the quiescence routine. Are there any comparable node ...
by SMIRF
Thu Feb 26, 2015 12:10 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: perft(6) after e4 e5
Replies: 15
Views: 2150

Re: perft(6) after e4 e5

Perft 5 and 6 both did not fail. So I have to look further. Skipper crashed when taking back rook on f1 and it said that the square is not occupied. XFEN 00: rnbqkb1r/pppp1ppp/5n2/4p3/4P3/5N2/PPPP1PPP/RNBQKB1R w KQkq - 2 3 +-*--b--c--d--*--f--g--*-+ 8 |[r][n][b][q][k][b] [r]| Compiled on Feb 26 201...
by SMIRF
Thu Feb 26, 2015 11:31 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: perft(6) after e4 e5
Replies: 15
Views: 2150

Re: perft(6) after e4 e5

zullil wrote:... Is likely irrelevant, but Reinhard's FEN is incorrect. Should be

rnbqkbnr/pppp1ppp/8/4p3/4P3/8/PPPP1PPP/RNBQKBNR w KQkq e6 0 2
As you will have noticed: it is compatible ! XFEN. There only then an e.p. coordinate is set, when an opposite pawn is standing at the side of the double stepped pawn.
by SMIRF
Thu Feb 26, 2015 11:19 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: perft(6) after e4 e5
Replies: 15
Views: 2150

Re: perft(6) after e4 e5

XFEN 00: rnbqkbnr/pppp1ppp/8/4p3/4P3/8/PPPP1PPP/RNBQKBNR w KQkq - 0 2 +-*--b--c--d--*--f--g--*-+ 8 |[r][n][b][q][k][b][n][r]| Compiled on Feb 26 2015 7 |[p][p][p][p]:::[p][p][p]| MS Vis.Studio C/C++ 64-Bit Vers. 18.0 6 | ::: ::: ::: :::| 5 |::: ::: [p] ::: | Break, when time >= 5.0 sec 4 | ::: :::<...
by SMIRF
Thu Feb 26, 2015 10:18 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Search algorithm in it's simplest forum
Replies: 27
Views: 6676

Re: Search algorithm in it's simplest forum

While I am also just about to optimize my quiescence search, it would be helpful to know, whether there are common testing examples. Those examples should provide their node expansions' count at a given alpha/beta range. This would help to review the quality of the used move sort and the correctness...