Urban Koistinen

Home * People * Urban Koistinen

Urban Koistinen [1] Urban Koistinen,

a Swedish mathematician and computer scientist. While affiliated with the KTH 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].

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 [6]
• Generating egtbs ICGAJ by Tony Werten, CCC, December 04, 2001 [7]

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

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

2010 …#

• KK partitioning+very cheap compression fit in 8 GB (7-man) by Urban Koistinen, CCRL Discussion Board, May 30, 2010 » Endgame Tablebases
• Re: New 6-piece tablebase generator by Urban Koistinen, CCRL Discussion Board, April 23, 2013 » Syzygy Bases
• Re: 7-piece syzygy by Urban Koistinen, CCRL Discussion Board, June 09, 2015

External Links#

• Koistinen (Urban Koistinen) · GitHub

Koistinen/Endgame · GitHub

• Urban Koistinen - Google+
• Urban Koistinen - homepage
• Computing endgames with few men by Urban Koistinen [8]

References#

1. ↑ Koistinen (Urban Koistinen) · GitHub
2. ↑ Re: Datastructures in computer chess by Urban Koistinen, rgcc, May 17, 1999
3. ↑ Re: Rotated bitboards by Urban Koistinen, rgcc, October 31, 1997
4. ↑ PLY/SSDF – the story ( Wayback Machine, July 2018)
5. ↑ Computing endgames with few men by Urban Koistinen
6. ↑ Computing endgames with few men by Urban Koistinen
7. ↑ Ren Wu, Don Beal (2001). Fast, Memory-efficient Retrograde Algorithms. ICGA Journal, Vol. 24, No. 3
8. ↑ EGTB: Better algorithm by Urban Koistinen, CCC, April 07, 2001

Up one level