Urban+Koistinen

toc a Swedish mathematician and computer scientist. While affiliated with the [|Royal Institute of Technology] in [|Stockholm], he was quite active in computer chess programming, and already introduced none rotated bitboard techniques to determine sliding piece attacks in 1997. Urban Koistinen became Editor of the Swedish PLY Computer Chess Magazine of the SSDF in 1997, and in 2001, he proposed an efficient indexing scheme for endgame bitbases with few men, which is published under the [|GNU Free Documentation License]. He is active poster in CCRL Discussion Board - Endgame Tablebases. =Forum Posts= > [|Wu/Beal predates Koistinen] by Guy Haworth, CCC, December 04, 2001
 * Home * People * Urban Koistinen**
 * Urban Koistinen**,
 * [|bitmaps of rotated boards] by Urban Koistinen, gnu.chess, March 2, 1995 » Rotated Bitboards
 * [|Re: Rotated bitboards] by Urban Koistinen, rgcc, October 31, 1997 » Collapsed files, Collapsed ranks
 * [|Re: Datastructures in computer chess] by Urban Koistinen, rgcc, May 17, 1999
 * [|EGTB: Better algorithm] by Urban Koistinen, CCC, April 07, 2001
 * [|Generating egtbs ICGAJ] by Tony Werten, CCC, December 04, 2001

=External Links= > [|Koistinen/Endgame · GitHub] =References= =What links here?= include page="Urban Koistinen" component="backlinks" limit="40"
 * [|Urban Koistinen - homepage]
 * [|Computing endgames with few men] by Urban Koistinen
 * [|Koistinen (Urban Koistinen) · GitHub]
 * Up one level**