Urban Koistinen

From Chessprogramming wiki
Revision as of 11:41, 27 February 2019 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Urban Koistinen''' FILE:UrbanKoistinen.jpg|border|right|thumb|link=https://github.com/Koistinen|Urban Koistinen <ref>[https://github.c...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * People * Urban Koistinen

Urban Koistinen [1]

Urban Koistinen,
a Swedish mathematician and computer scientist. While affiliated with the Royal Institute of Technology in Stockholm, he was active in computer chess programming [2], and introduced none rotated bitboard techniques to determine sliding piece attacks in 1997 [3]. Urban Koistinen became editor of the Swedish PLY Computer Chess Magazine of the SSDF in 1997 [4], and in 2001, he proposed an efficient indexing scheme for endgame bitbases with few men, which was published under the GNU Free Documentation License [5].

Forum Posts

1995 ...

2000 ...

Wu/Beal predates Koistinen by Guy Haworth, CCC, December 04, 2001

2005 ...

External Links

Koistinen/Endgame · GitHub

References

Up one level