Difference between revisions of "Urban Koistinen"
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...") |
GerdIsenberg (talk | contribs) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 4: | Line 4: | ||
'''Urban Koistinen''',<br/> | '''Urban Koistinen''',<br/> | ||
| − | a Swedish mathematician and computer scientist. While affiliated with the [https://en.wikipedia.org/wiki/ | + | a Swedish mathematician and computer scientist. While affiliated with the [https://en.wikipedia.org/wiki/KTH_Royal_Institute_of_Technology KTH Royal Institute of Technology] in [https://en.wikipedia.org/wiki/Stockholm Stockholm], he was active in computer chess programming <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/L_roj2Mawg0/1lidUNmd3dsJ Re: Datastructures in computer chess] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], May 17, 1999</ref>, and introduced [[Occupancy of any Line#CollapsedFiles|none rotated bitboard techniques]] to determine [[Sliding Piece Attacks|sliding piece attacks]] in 1997 <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/YvFagyuVogw/2vNJw_qT8IYJ Re: Rotated bitboards] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], October 31, 1997</ref>. Urban Koistinen became editor of the Swedish [[PLY (Magazine)|PLY]] Computer Chess Magazine of the [[SSDF]] in 1997 <ref>[https://web.archive.org/web/20180713223218/http://privat.bahnhof.se/wb432434/historik.htm PLY/SSDF – the story] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine], July 2018)</ref>, and in 2001, he proposed an efficient indexing scheme for [[Endgame Bitbases|endgame bitbases]] with few men, which was published under the [https://en.wikipedia.org/wiki/GNU_Free_Documentation_License GNU Free Documentation License] <ref>[http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref>. |
=Forum Posts= | =Forum Posts= | ||
| Line 16: | Line 16: | ||
* [https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001 <ref>[[Ren Wu]], [[Don Beal]] ('''2001'''). ''Fast, Memory-efficient Retrograde Algorithms''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]</ref> | * [https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001 <ref>[[Ren Wu]], [[Don Beal]] ('''2001'''). ''Fast, Memory-efficient Retrograde Algorithms''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]</ref> | ||
: [https://www.stmintz.com/ccc/index.php?id=200376 Wu/Beal predates Koistinen] by [[Guy Haworth]], [[CCC]], December 04, 2001 | : [https://www.stmintz.com/ccc/index.php?id=200376 Wu/Beal predates Koistinen] by [[Guy Haworth]], [[CCC]], December 04, 2001 | ||
| − | |||
* [https://groups.google.com/d/msg/rec.games.chess.computer/lXIoGtvZ9b4/6zSqwV5iZCsJ Re: Extending endgame database using grid computing?] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], February 24, 2005 | * [https://groups.google.com/d/msg/rec.games.chess.computer/lXIoGtvZ9b4/6zSqwV5iZCsJ Re: Extending endgame database using grid computing?] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], February 24, 2005 | ||
| + | ==2010 ...== | ||
| + | * [http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=5163 KK partitioning+very cheap compression fit in 8 GB (7-man)] by [[Urban Koistinen]], [[Computer Chess Forums|CCRL Discussion Board]], May 30, 2010 » [[Endgame Tablebases]] | ||
| + | * [http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=6971&start=11 Re: New 6-piece tablebase generator] by [[Urban Koistinen]], [[Computer Chess Forums|CCRL Discussion Board]], April 23, 2013 » [[Syzygy Bases]] | ||
| + | * [http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=7618&start=4 Re: 7-piece syzygy] by [[Urban Koistinen]], [[Computer Chess Forums|CCRL Discussion Board]], June 09, 2015 | ||
=External Links= | =External Links= | ||
Latest revision as of 20:23, 18 July 2020
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].
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 [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
- Urban Koistinen - Google+
- Urban Koistinen - homepage
- Computing endgames with few men by Urban Koistinen [8]
References
- ↑ Koistinen (Urban Koistinen) · GitHub
- ↑ Re: Datastructures in computer chess by Urban Koistinen, rgcc, May 17, 1999
- ↑ Re: Rotated bitboards by Urban Koistinen, rgcc, October 31, 1997
- ↑ PLY/SSDF – the story (Wayback Machine, July 2018)
- ↑ Computing endgames with few men by Urban Koistinen
- ↑ Computing endgames with few men by Urban Koistinen
- ↑ Ren Wu, Don Beal (2001). Fast, Memory-efficient Retrograde Algorithms. ICGA Journal, Vol. 24, No. 3
- ↑ EGTB: Better algorithm by Urban Koistinen, CCC, April 07, 2001
