Difference between revisions of "Space-Time Tradeoff"

From Chessprogramming wiki
Jump to: navigation, search
Line 40: Line 40:
 
* [https://en.everybodywiki.com/Burton_Howard_Bloom Burton H. Bloom] ('''1970'''). ''[https://dl.acm.org/doi/10.1145/362686.362692 Space/time trade-offs in hash coding with allowable errors]''. [[ACM#Communications|Communications of the ACM]], Vol. 13, No. 7 <ref>[https://en.wikipedia.org/wiki/Bloom_filter Bloom filter from Wikipedia]</ref>  
 
* [https://en.everybodywiki.com/Burton_Howard_Bloom Burton H. Bloom] ('''1970'''). ''[https://dl.acm.org/doi/10.1145/362686.362692 Space/time trade-offs in hash coding with allowable errors]''. [[ACM#Communications|Communications of the ACM]], Vol. 13, No. 7 <ref>[https://en.wikipedia.org/wiki/Bloom_filter Bloom filter from Wikipedia]</ref>  
 
* [[Albert Zobrist]], [[Frederic Roy Carlson]] ('''1977'''). ''Detection of Combined Occurrences''. [[ACM#Communications|Communications of the ACM]], Vol. 20, No. 1
 
* [[Albert Zobrist]], [[Frederic Roy Carlson]] ('''1977'''). ''Detection of Combined Occurrences''. [[ACM#Communications|Communications of the ACM]], Vol. 20, No. 1
 +
 +
=Forum Posts=
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=73273 Stockfish and latest +6 ELO patch!] by [[Jouni Uski]], [[CCC]], March 05, 2020 » [[Distance]], [[Stockfish]]<ref>[https://github.com/official-stockfish/Stockfish/commit/5a7b45eac9dedbf7ebc61d9deb4dd934058d1ca1#diff-4cd6bcdb505b124d7bdc612c4789dc26L57-R59 Use equations for PushAway and PushClose · official-stockfish/Stockfish@5a7b45e · GitHub]</ref>
  
 
=External Links=  
 
=External Links=  

Revision as of 13:16, 6 March 2020

Home * Programming * Space-Time Tradeoff

Space-time Vortex [1]

Space-Time Tradeoff refers to providing knowledge, information or data, where memory size competes with computation time. This tradeoff is a frequent issue in computer chess programming, for instance low level stuff to calculate or lookup single populated bitboards by square index, or a distance between two squares. Lookup tables are non-volatile tables or initialized once at program startup, various hash tables and caches. Space-time tradeoff is also an issue in determining (almost) perfect knowledge from interior node recognizers by retrograde analysis, that is the application of endgame bit- or tablebases and various compression techniques.

Space-Time Tradeoffs

There are multiple CPW pages where memory competes with computation:

See also

Publications

Forum Posts

External Links

In Memoriam Wolf Escher

References

Up one Level