Search found 244 matches

by MichelG
Thu Jul 09, 2015 13:07
Forum: Draughts, Computer, Internet
Topic: Scan
Replies: 164
Views: 86104

Re: Scan

To my knowledge this is exactly what Michel is doing, so it's certainly possible. I didn't carefully think about it because I assumed that: 1) bitboards would only easily allow base-4 indices instead of base 3. For 8 squares already this would waste 90% of the index space, not to mention larger pat...
by MichelG
Mon Jul 06, 2015 19:31
Forum: Draughts, Computer, Internet
Topic: Computer Olympiad 2015 Leiden
Replies: 36
Views: 17661

Re: Computer Olympiad 2015 Leiden

What kind of machine learning? Offline fitting of eval coefficients and/or book expansion? Or online learning of dynamic search parameters? Offline learning of Eval coefficients. Whereas a human can fine-tune tens or may a hundred eval parameters, machine learning takes it a step further. Scan was ...
by MichelG
Mon Jul 06, 2015 12:56
Forum: Draughts, Computer, Internet
Topic: Computer Olympiad 2015 Leiden
Replies: 36
Views: 17661

Re: Computer Olympiad 2015 Leiden

So how does the Draughts-programming community look upon the victory of Scan? Is this a sensational and revolutionary development? I understood Fabien's program did not even use end-game tables. Congratulations to Fabien! Scan's result has been excellent. The reason it is so strong seems that it is...
by MichelG
Tue Aug 05, 2014 13:18
Forum: Draughts, Computer, Internet
Topic: Brief parts of draughts
Replies: 26
Views: 12933

Re: Brief parts of draughts

In conclusion: - the current damexchange format already allows for faster games by setting time to non-integer value. Only Dragon and Kingsrow appear to support this, but they limit the shortest time to 0.9 and 1.0 minutes a game while playing against external engines. - Rein has suggested a damexch...
by MichelG
Tue Jul 22, 2014 23:00
Forum: Draughts, Computer, Internet
Topic: Brief parts of draughts
Replies: 26
Views: 12933

Re: Brief parts of draughts

OK, I understand. But you could either make Dragon's cleanup behavior conditional on the requested time control, or simply decline requests for ultra fast games. I don't think that the dxp standard should depend on what a single program (yours, mine or anyone else's) chooses to support. Chess has s...
by MichelG
Tue Jul 22, 2014 20:33
Forum: Draughts, Computer, Internet
Topic: Brief parts of draughts
Replies: 26
Views: 12933

Re: Brief parts of draughts

Why should program startup time matter? As soon as your program is ready, you start doing GAMEACC, and not before. I mean the per move startup time. Dragon for instance resets the killer-heuristics tables, counters, hashtables and other tables before each move. It does this in order to increase rep...
by MichelG
Tue Jul 22, 2014 15:48
Forum: Draughts, Computer, Internet
Topic: Brief parts of draughts
Replies: 26
Views: 12933

Re: Brief parts of draughts

I don't think the time should be in the gamerequest message, not in a chat message, as you may want to refuse a short-timed game; at some point even initialising your (hash)tables will take more time than allowed by the game speed. Adding stuff to chat command just complicates the protocol unnecessa...
by MichelG
Fri Jul 18, 2014 18:38
Forum: Draughts, Computer, Internet
Topic: Brief parts of draughts
Replies: 26
Views: 12933

Re: Brief parts of draughts

Damexchange does not support a time setting below 1 minute/game, so no programms will work at with that time.

Dragon allows 0.9 minutes/game, but does that by ignoring some of the damexchange standard.

Michel
by MichelG
Fri Apr 18, 2014 09:09
Forum: Draughts, Computer, Internet
Topic: Internet engine matches
Replies: 470
Views: 181551

Re: Internet engine matches

Match DRAGON - FLITS (2 ply balanced.pdn) Dragon Pro 4.4.0 - Flits 11 wins, 2 losses, 145 draws Here interesting information for Michel. Somehow strange the program is saving that's all. After 73 opening it is necessary anew to start the match.The program isn't also displaying draws. Good to see th...
by MichelG
Fri Apr 11, 2014 12:44
Forum: Draughts, Computer, Internet
Topic: Internet engine matches
Replies: 470
Views: 181551

Re: Internet engine matches

I guess that (at least based on communicated match results) Dragon, KingsRow and Damage are in the same league. Most likely the ELO differences (if any) are in the 5 points region. So now the challenge is to find new ideas which will create a 30 - 50 ELO improvement. But I'm afraid it is not easy a...
by MichelG
Wed Apr 09, 2014 12:43
Forum: Draughts, Computer, Internet
Topic: Internet engine matches
Replies: 470
Views: 181551

Re: Internet engine matches

Hi dear programmer, thiese results that there mean that Dragon is stronger than Kingsrow? IT SEEN THAt the calculation strenght and speed of Dragon is better than ever. Dragon and Kingsrow are much closer in strength than these results appear to show. I think dragon is winning the 1 minute match 25...
by MichelG
Thu Apr 03, 2014 12:53
Forum: Draughts, Computer, Internet
Topic: Search Algorithm
Replies: 711
Views: 236507

Re: Search Algorithm

It takes some effort and compromises to make your engine play faster games, but i can tell you it is worth it. I do most tests in dragon by self-play, with 2 versions of the program running in the same executable. That way you can avoid the communication time. In many cases, i can test under single-...
by MichelG
Sun Mar 30, 2014 13:46
Forum: Draughts, Computer, Internet
Topic: Suggestion about Dragon 4.2
Replies: 24
Views: 15631

Re: Suggestion about Dragon 4.2

Dragon v4.4 is now available for download. This release is mostly about making things easier for the user, but also fixes some bugs in the engine and damexchange. Dragon can be downloaded from http://mdgsoft.home.xs4all.nl/draughts/index.html Changelog: interface: * open .pdn files automatically * i...
by MichelG
Mon Mar 17, 2014 21:47
Forum: Draughts, Computer, Internet
Topic: Search Algorithm
Replies: 711
Views: 236507

Re: Search Algorithm

Michel, you are right that "practical" needs to be defined in a better way. I also applied a definition like your definition 2. The numbers presented in the graph are based on frequent-like positions. Also my conclusion so far is that a mid game table seems to be feasible for a supercomputer setup ...
by MichelG
Sun Mar 16, 2014 12:08
Forum: Draughts, Computer, Internet
Topic: Search Algorithm
Replies: 711
Views: 236507

Re: Search Algorithm

I tried to get a better approximation (and understanding) for the "practical" size of the Draughts state-space. Herewith the first results for the equal man positions. In the graph I also plotted the maximum number of positions based on combinatorial analysis (which I shared also in the past). This...