Space-Time Tradeoff

From Chessprogramming wiki
Revision as of 15:19, 11 May 2018 by GerdIsenberg (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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

1995 double trio: Adrian Belew, Bill Bruford, Robert Fripp, Trey Gunn, Tony Levin, Pat Mastelotto

References

Up one Level