Urban Koistinen

Home * People * Urban Koistinen 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, and 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 was published under the GNU Free Documentation License. =Forum Posts=

1995 ...

 * 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

2000 ...

 * Re: Does Unmake Move Really Save Time? by Urban Koistinen, rgcc, March 09, 2001 » Unmake Move
 * EGTB: Better algorithm by Urban Koistinen, CCC, April 07, 2001
 * Generating egtbs ICGAJ by Tony Werten, CCC, December 04, 2001
 * Wu/Beal predates Koistinen by Guy Haworth, CCC, December 04, 2001

2005 ...

 * Re: Extending endgame database using grid computing? by Urban Koistinen, rgcc, February 24, 2005

=External Links=
 * Koistinen (Urban Koistinen) · GitHub
 * Koistinen/Endgame · GitHub

=References= Up one level
 * Urban Koistinen - Google+
 * Urban Koistinen - homepage
 * Computing endgames with few men by Urban Koistinen