Will you use hash saving?
Moderators: hgm, Rebel, chrisw
-
- Posts: 2204
- Joined: Sat Jan 18, 2014 10:24 am
- Location: Andorra
-
- Posts: 273
- Joined: Sat Apr 17, 2010 2:34 pm
- Location: Budapest
Re: Will you use hash saving?
What about saving the hash (or part of it) to a pgn-file? Then we could use some mining tools (like CQL http://gadycosteff.com/cql/doc/introduction.html) to find interesting positions or lines.
-
- Posts: 570
- Joined: Mon Jul 20, 2015 5:06 pm
Re: Will you use hash saving?
What is hash saving? Is this another name for persistent hash?cdani wrote:I'm curious if this will be used.
http://chessprogramming.wikispaces.com/ ... Hash+Table
-
- Posts: 2204
- Joined: Sat Jan 18, 2014 10:24 am
- Location: Andorra
Re: Will you use hash saving?
No, is just to save the whole main hash to disk:D Sceviour wrote:What is hash saving? Is this another name for persistent hash?cdani wrote:I'm curious if this will be used.
http://chessprogramming.wikispaces.com/ ... Hash+Table
http://talkchess.com/forum/viewtopic.php?t=64720
So saving the transposition table, if you prefer:
https://chessprogramming.wikispaces.com ... tion+Table
Daniel José - http://www.andscacs.com
-
- Posts: 2204
- Joined: Sat Jan 18, 2014 10:24 am
- Location: Andorra
Re: Will you use hash saving?
A hash table can contain several millions of entries. So a pgn file seems not to be a good container for it. Also there are a lot of other drawbacks.Arpad Rusz wrote:What about saving the hash (or part of it) to a pgn-file? Then we could use some mining tools (like CQL http://gadycosteff.com/cql/doc/introduction.html) to find interesting positions or lines.
https://chessprogramming.wikispaces.com ... tion+Table
Daniel José - http://www.andscacs.com
-
- Posts: 273
- Joined: Sat Apr 17, 2010 2:34 pm
- Location: Budapest
Re: Will you use hash saving?
Pgn databases can also contain millions of games and even more positions. But I was thinking mainly to save only parts of the hash (by material "slices" if I am interested in - for example - rook endgames, or by depth).cdani wrote:
A hash table can contain several millions of entries. So a pgn file seems not to be a good container for it. Also there are a lot of other drawbacks.
Of course the information in the hash is full of noise and gaps but it would be nice to have a peek.
-
- Posts: 2204
- Joined: Sat Jan 18, 2014 10:24 am
- Location: Andorra
Re: Will you use hash saving?
A hash viewer/searcher can be done, but is quite a lot of work. Many people should ask for it so maybe some programmer decides to do it. But I'm not sure if it will be very valuable.Arpad Rusz wrote:Pgn databases can also contain millions of games and even more positions. But I was thinking mainly to save only parts of the hash (by material "slices" if I am interested in - for example - rook endgames, or by depth).cdani wrote:
A hash table can contain several millions of entries. So a pgn file seems not to be a good container for it. Also there are a lot of other drawbacks.
Of course the information in the hash is full of noise and gaps but it would be nice to have a peek.
Daniel José - http://www.andscacs.com
-
- Posts: 411
- Joined: Thu Dec 30, 2010 4:48 am
Re: Will you use hash saving?
A hashtable as tree viewer should be of great value to developers themself at least as a quick way to view why an engine's not finding a particular move and make the right attempt to create a patch to try and solve the problem. In a lot of cases it might be usable by experienced end users who simply want to know 'why not move X?' without interrupting the current search - but that use case is a bit more questionable. It really ought to be done as a gui feature + protocol extension to be interactive at any point in the search.cdani wrote:A hash viewer/searcher can be done, but is quite a lot of work. Many people should ask for it so maybe some programmer decides to do it. But I'm not sure if it will be very valuable.Arpad Rusz wrote:Pgn databases can also contain millions of games and even more positions. But I was thinking mainly to save only parts of the hash (by material "slices" if I am interested in - for example - rook endgames, or by depth).cdani wrote:
A hash table can contain several millions of entries. So a pgn file seems not to be a good container for it. Also there are a lot of other drawbacks.
Of course the information in the hash is full of noise and gaps but it would be nice to have a peek.
-
- Posts: 545
- Joined: Tue Jun 06, 2017 4:49 pm
- Location: Italy
Re: Will you use hash saving?
My two cents here. I'm not a programmer and I don't know if this makes some senses: 99% of hashed positions are of no importance. They're stored there only because of possible trasposition and it could take a lot of time to study them to understand if theres a problem with search.kbhearn wrote: A hashtable as tree viewer should be of great value to developers themself at least as a quick way to view why an engine's not finding a particular move and make the right attempt to create a patch to try and solve the problem. In a lot of cases it might be usable by experienced end users who simply want to know 'why not move X?' without interrupting the current search - but that use case is a bit more questionable. It really ought to be done as a gui feature + protocol extension to be interactive at any point in the search.
Anyway, I guess the fastest way to "read" the hash contents could be to convert them to an EPD file, and to use an utility to get a tree out of them. I don't know if such an utility exists, anyway.
(Please someone could tell me if I'm writing idiocies?)
F.S.I. Chess Teacher