Difference between revisions of "Space-Time Tradeoff"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * Programming * Space-Time Tradeoff''' FILE:vortex1_med.jpg|border|right|thumb|link=http://www.physorg.com/news8256.html|Space-time Vortex <ref>[h...")
 
m
Line 62: Line 62:
 
* [https://en.wikipedia.org/wiki/Art_of_memory Art of memory from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Art_of_memory Art of memory from Wikipedia]
 
* [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]
* [[Videos#KingCrimson|King Crimson]] - [https://en.wikipedia.org/wiki/Thrak One Time], [https://en.wikipedia.org/wiki/YouTube YouTube] Video
+
* [[Videos#KingCrimson|King Crimson]] - [https://en.wikipedia.org/wiki/Thrak One Time] (Live In Japan), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: 1995 double trio: [[Videos#AdrianBelew|Adrian Belew]], [[Videos#BillBruford|Bill Bruford]], [[Videos#RobertFripp|Robert Fripp]], [https://en.wikipedia.org/wiki/Trey_Gunn Trey Gunn], [https://en.wikipedia.org/wiki/Tony_Levin Tony Levin], [https://en.wikipedia.org/wiki/Pat_Mastelotto Pat Mastelotto]
+
: {{#evu:https://www.youtube.com/watch?v=zP2Rs5qHRCQ|alignment=left|valignment=top}}
: {{#evu:https://www.youtube.com/watch?v=RhJKCW2_w3k|alignment=left|valignment=top}}
 
  
 
=References=  
 
=References=  

Revision as of 14:38, 11 May 2018

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

References

Up one Level