Search found 88 matches

by ibid
Thu Jul 28, 2016 10:38 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: perft for 8x8 checkers
Replies: 22
Views: 6144

Re: Search space complexity of the game of nxn checkers.

Aart, Paul... any chance of Perft(29) of English draughts? In principle it is certainly possible. Perft(28) took a little under a week for me and the program could probably be made a little faster (the hash table implementation is exceptionally crude). With the low branching in checkers, 29 and 30 ...
by ibid
Wed May 11, 2016 10:26 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft(7) challenge set #7 (6 pairs from work unit 444)
Replies: 7
Views: 968

Re: Perft(7) challenge set #7 (6 pairs from work unit 444)

Perft(7) challenge set #7 (6 pairs from work unit 444) rocky:~ sje$ diff ~/Ankan/results/4/wu7.444.sum ~/Perft14Res/4/wu7.444.sum 19318c19318 < rn1qkbnr/p1pp1ppp/b3p3/1p6/6P1/4P2Q/PPPP1P1P/RNB1KBNR b KQkq - 2 4 21 23414856228 491711980788 --- > rn1qkbnr/p1pp1ppp/b3p3/1p6/6P1/4P2Q/PPPP1P1P/RNB1KBNR ...
by ibid
Sat Apr 30, 2016 7:37 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft(7) challenge position #5
Replies: 25
Views: 5223

Re: How bad is it?

For fun, I let this run until perft 8 finished. (Took my program about 3 days!) Could someone with a faster search verify the result? Thanks! Perft 1 = 40 Perft 2 = 1091 Perft 3 = 41284 Perft 4 = 1149593 Perft 5 = 42490376 Perft 6 = 1226949550 Perft 7 = 44950307154 Perft 8 = 1348381824306 gperft ag...
by ibid
Sun Feb 21, 2016 3:57 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft(14) Weekly Status Reports for 2016
Replies: 75
Views: 21908

Re: Perft(14) Weekly Status 2016-02-14

8 digits... [D]r1bqkbnr/p1pppppp/2n5/1p6/8/3P1P2/PPPBP1PP/RN1QKBNR b KQkq - perft( 1)= 23 ( 0.000 sec) perft( 2)= 615 ( 0.000 sec) perft( 3)= 15369 ( 0.001 sec) perft( 4)= 412791 ( 0.004 sec) perft( 5)= 11111111 ( 0.082 sec)
by ibid
Sun Feb 21, 2016 3:48 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft(14) Weekly Status Reports for 2016
Replies: 75
Views: 21908

Re: Perft(14) Weekly Status 2016-02-14

Hi, Steven. Possible to find position perft(n)=123456789, 33333333 or 100000000? Seven sevens? (Alas, it is perft 5, not 7) [D]rnbqkbnr/ppppp2p/6p1/5p2/8/BP6/P1PPPPPP/RNQ1KBNR b KQkq - perft( 1)= 21 ( 0.000 sec) perft( 2)= 502 ( 0.000 sec) perft( 3)= 11719 ( 0.000 se...
by ibid
Tue Sep 01, 2015 4:47 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft using nullmove
Replies: 6
Views: 2487

Re: Perft using nullmove

PS. There is (at least) one position gperft by Paul Byrne beats my program: CPW 3: gperft takes 139.764 seconds, mine 145.809s I'm glad such a position still exists! :) I've been playing with a number of ways of doing nullmove-based perfts, at present I am going about it in a somewhat different way...
by ibid
Sat Aug 29, 2015 7:15 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft using nullmove
Replies: 6
Views: 2487

Re: Perft using nullmove

Some time ago I thought I should try out some of the features of C++, and eventually rewrite my engine Sillycon from scratch using C++. Then of course the first step is to write a move generator, and this needs a perft function for verification. Since I have seen some other using nullmove in perft ...
by ibid
Fri Jul 24, 2015 11:02 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Binary FEN
Replies: 16
Views: 4636

Re: Binary FEN

There has been discussion of using FEN to store positions in databases. It seems to me that a binary format could be more space efficient and at least as easy to parse. The format I devised is: 64 bit bitmap where each 1 bit represents an occupied square or the ep square if there is one. 32 4 bit c...
by ibid
Wed Jul 08, 2015 7:53 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft(15) - it will cost you only US$500,000
Replies: 14
Views: 3183

Re: Perft(15) - it will cost you only US$500,000

That makes a lot of assumptions. Smarter perft programs, e.g. incrementally calculating the number of moves in the last ply rather than generating them all, could easily speed up the calculation by a factor 30 compared to existing perft programs. The forelast move does not have that much effect on ...
by ibid
Sat Jul 04, 2015 3:55 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft(7) test suites just for you
Replies: 21
Views: 3490

Re: From 000-099/wu7.014.sum

[...]It took about 67 seconds wall time for the perft(7) calculation. The above ran on a 2006 dual 2.66 GHz Xeon Mac, a machine about 20% as fast as top end 2015 consumer hardware. [...] WOW... 67 seconds??? Of course your is a perft only software (you don't store move, don't sort them and so on) b...