Difference between revisions of "Space-Time Tradeoff"

From Chessprogramming wiki
Jump to: navigation, search
Line 64: Line 64:
 
* [https://en.wikipedia.org/wiki/Eureka:_A_Prose_Poem Eureka: A Prose Poem from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Eureka:_A_Prose_Poem Eureka: A Prose Poem from Wikipedia]
 
* [[:Category:Time in Space|Time in Space]] -  God Bless the Child, [https://de.wikipedia.org/wiki/Domicil Domicil], [https://en.wikipedia.org/wiki/Dortmund Dortmund], February 3, 2017, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
 
* [[:Category:Time in Space|Time in Space]] -  God Bless the Child, [https://de.wikipedia.org/wiki/Domicil Domicil], [https://en.wikipedia.org/wiki/Dortmund Dortmund], February 3, 2017, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
 +
: In Memoriam [https://de.wikipedia.org/wiki/Wolf_Escher Wolf Escher]
 
: {{#evu:https://www.youtube.com/watch?v=XGcaF8JHHDk|alignment=left|valignment=top}}
 
: {{#evu:https://www.youtube.com/watch?v=XGcaF8JHHDk|alignment=left|valignment=top}}
  

Revision as of 11:14, 13 January 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

External Links

In Memoriam Wolf Escher

References

Up one Level