25,161
edits
Changes
Created page with "'''Home * People * Pradu Kannan''' FILE:PrasuAtNiagara.jpg|border|right|thumb|link=http://pradu.us/home/| Pradu Kannan <ref>[http://pradu.us/home/ Pradu's..."
'''[[Main Page|Home]] * [[People]] * Pradu Kannan'''
[[FILE:PrasuAtNiagara.jpg|border|right|thumb|link=http://pradu.us/home/| Pradu Kannan <ref>[http://pradu.us/home/ Pradu's Home Page], [https://en.wikipedia.org/wiki/Niagara_Falls Niagra Falls], [https://en.wikipedia.org/wiki/Maid_of_the_Mist Maid of the Mist]</ref> ]]
'''Pradyumna (Pradu) Kannan''' from [https://en.wikipedia.org/wiki/Chandler,_Arizona Chandler, Arizona], USA - author of the chess engine [[Buzz]] <ref>[http://www.pradu.us/old/Nov27_2008/Buzz/ Buzz - A Winboard Chess Playing Program by Pradu Kannan]</ref>. He is an aerospace engineer and studied aerospace engineering at [[Georgia Institute of Technology]] in [https://en.wikipedia.org/wiki/Atlanta Atlanta], [https://en.wikipedia.org/wiki/Georgia_%28U.S._state%29 Georgia]. His hobby as a chess programmer started in 2004 and was inspired by ''[[François-Dominic Laramée#ChessProgramming|GameDev's chess programming article]]'' by [[François-Dominic Laramée]] . He then wrote his first chess engine [[Witz]] <ref>[http://witz.sf.net/ Witz Homepage]</ref> which was initially a [[0x88]] engine and was subsequently rewritten with [[bitboards]]. In May 2006, he started working on his current bitboard chess engine [[Buzz]], and short after as team effort along with [[Andres Valverde]] and [[Fonzy Bluemers]], on the engine [[Dirty]], which is a hybrid between Buzz ([[Search]]) and [[EveAnn]] ([[Evaluation]]) <ref>[http://www.dirtychess.com/ Dirty Chess Engine]</ref>.
=Magic Bitboards=
Pradu Kannan made [[Lasse Hansen|Lasse Hansen's]] initial [[Magic Bitboards|Magic Bitboard]] approach to process both lines of a rook- or bishop movement simultaneously <ref>[http://www.open-aurec.com/wbforum/viewtopic.php?t=5015 Fast(er) bitboard move generator] by [[Lasse Hansen]], [[Computer Chess Forums|Winboard Forum]], June 14, 2006</ref> applicable with respect to memory size, as he proposed a [[Java]]-like, two-dimensional [[Array|array]] with individual size for each square <ref>[http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5452 Fastest Magic Move Bitboard Generator ready to use] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], August 25, 2006</ref> <ref>[[Pradu Kannan|Pradyumna Kannan]] ('''2007'''). ''Magic Move-Bitboard Generation in Computer Chess''. [http://www.pradu.us/old/Nov27_2008/Buzz/research/magic/Bitboards.pdf pdf]</ref>.
=Photos=
[[FILE:BobPradu2008.JPG|none|border|text-bottom|link=http://aigames.net/ACCA/ACCAChampionships/ACCA2008Championships/SitePics.html]]
[[Robert Hyatt|Bob Hyatt]] and [[Pradu Kannan]] at [[ACCA 2008]], Bob implementing Magics? <ref>Bob implementing Magics? No, that already happened in 2006, [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5452&start=56 Re: Fastest Magic Move Bitboard Generator ready to use] by [[Robert Hyatt]], [[Computer Chess Forums|Winboard Forum]], November 09, 2006</ref> <ref>[http://aigames.net/ACCA/ACCAChampionships/ACCA2008Championships/SitePics.html The 2008 Third Annual ACCA Americas' Computer Chess Chamionships Site Pics] from [[University of Alabama at Birmingham|UAB]]</ref>
=See also=
* [[Pawn Advantage, Win Percentage, and ELO]] by [[Sune Fischer]] and [[Pradu Kannan]], December 2007
=Publications=
* [[Pradu Kannan|Pradyumna Kannan]] ('''2007'''). ''Magic Move-Bitboard Generation in Computer Chess''. [http://www.pradu.us/old/Nov27_2008/Buzz/research/magic/Bitboards.pdf pdf]
=Forum Posts=
==2005==
* [http://www.open-aurec.com/wbforum/viewtopic.php?t=1961 Static Exchange Evaluation Methods] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], March 14, 2005
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=3734 Selective Futlity Condition at Quiescence Nodes] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], October 26, 2005
==2006==
* [http://www.open-aurec.com/wbforum/viewtopic.php?t=5441 List of magics for bitboard move generation] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], August 23, 2006
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5452 Fastest Magic Move Bitboard Generator ready to use] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], August 25, 2006
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5779 Hash Table handling with LMR/Futility pruning] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], October 21, 2006
==2007==
* [http://www.open-aurec.com/wbforum/viewtopic.php?t=6104 SEE with magic bitboards] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], January 24, 2007
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6238 Handling 3-rep/50-move in hash tables] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], February 19, 2007 » [[Repetitions]], [[Transposition Table]]
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6461 Compiling for Unix] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], May 08, 2007 » [[Unix]]
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6558 Slight enhancement to PVS] by [[Pradu Kannan|Pradu]], [[Computer Chess Forums|Winboard Forum]], June 10, 2007 » [[Principal Variation Search]], [[Node Types]]
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6767 A Few General Questions on Parallel Search] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], August 31, 2007 » [[Parallel Search]]
==2008==
* [http://www.talkchess.com/forum/viewtopic.php?t=21233 Minimizing Sharing of Data between Physical Processors] by [[Pradu Kannan]], [[CCC]], May 19, 2008
==2009==
* [http://www.talkchess.com/forum/viewtopic.php?t=29434 Questions on volatile keyword and memory barriers] by [[Pradu Kannan]], [[CCC]], August 16, 2009
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:PrasuAtNiagara.jpg|border|right|thumb|link=http://pradu.us/home/| Pradu Kannan <ref>[http://pradu.us/home/ Pradu's Home Page], [https://en.wikipedia.org/wiki/Niagara_Falls Niagra Falls], [https://en.wikipedia.org/wiki/Maid_of_the_Mist Maid of the Mist]</ref> ]]
'''Pradyumna (Pradu) Kannan''' from [https://en.wikipedia.org/wiki/Chandler,_Arizona Chandler, Arizona], USA - author of the chess engine [[Buzz]] <ref>[http://www.pradu.us/old/Nov27_2008/Buzz/ Buzz - A Winboard Chess Playing Program by Pradu Kannan]</ref>. He is an aerospace engineer and studied aerospace engineering at [[Georgia Institute of Technology]] in [https://en.wikipedia.org/wiki/Atlanta Atlanta], [https://en.wikipedia.org/wiki/Georgia_%28U.S._state%29 Georgia]. His hobby as a chess programmer started in 2004 and was inspired by ''[[François-Dominic Laramée#ChessProgramming|GameDev's chess programming article]]'' by [[François-Dominic Laramée]] . He then wrote his first chess engine [[Witz]] <ref>[http://witz.sf.net/ Witz Homepage]</ref> which was initially a [[0x88]] engine and was subsequently rewritten with [[bitboards]]. In May 2006, he started working on his current bitboard chess engine [[Buzz]], and short after as team effort along with [[Andres Valverde]] and [[Fonzy Bluemers]], on the engine [[Dirty]], which is a hybrid between Buzz ([[Search]]) and [[EveAnn]] ([[Evaluation]]) <ref>[http://www.dirtychess.com/ Dirty Chess Engine]</ref>.
=Magic Bitboards=
Pradu Kannan made [[Lasse Hansen|Lasse Hansen's]] initial [[Magic Bitboards|Magic Bitboard]] approach to process both lines of a rook- or bishop movement simultaneously <ref>[http://www.open-aurec.com/wbforum/viewtopic.php?t=5015 Fast(er) bitboard move generator] by [[Lasse Hansen]], [[Computer Chess Forums|Winboard Forum]], June 14, 2006</ref> applicable with respect to memory size, as he proposed a [[Java]]-like, two-dimensional [[Array|array]] with individual size for each square <ref>[http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5452 Fastest Magic Move Bitboard Generator ready to use] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], August 25, 2006</ref> <ref>[[Pradu Kannan|Pradyumna Kannan]] ('''2007'''). ''Magic Move-Bitboard Generation in Computer Chess''. [http://www.pradu.us/old/Nov27_2008/Buzz/research/magic/Bitboards.pdf pdf]</ref>.
=Photos=
[[FILE:BobPradu2008.JPG|none|border|text-bottom|link=http://aigames.net/ACCA/ACCAChampionships/ACCA2008Championships/SitePics.html]]
[[Robert Hyatt|Bob Hyatt]] and [[Pradu Kannan]] at [[ACCA 2008]], Bob implementing Magics? <ref>Bob implementing Magics? No, that already happened in 2006, [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5452&start=56 Re: Fastest Magic Move Bitboard Generator ready to use] by [[Robert Hyatt]], [[Computer Chess Forums|Winboard Forum]], November 09, 2006</ref> <ref>[http://aigames.net/ACCA/ACCAChampionships/ACCA2008Championships/SitePics.html The 2008 Third Annual ACCA Americas' Computer Chess Chamionships Site Pics] from [[University of Alabama at Birmingham|UAB]]</ref>
=See also=
* [[Pawn Advantage, Win Percentage, and ELO]] by [[Sune Fischer]] and [[Pradu Kannan]], December 2007
=Publications=
* [[Pradu Kannan|Pradyumna Kannan]] ('''2007'''). ''Magic Move-Bitboard Generation in Computer Chess''. [http://www.pradu.us/old/Nov27_2008/Buzz/research/magic/Bitboards.pdf pdf]
=Forum Posts=
==2005==
* [http://www.open-aurec.com/wbforum/viewtopic.php?t=1961 Static Exchange Evaluation Methods] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], March 14, 2005
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=3734 Selective Futlity Condition at Quiescence Nodes] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], October 26, 2005
==2006==
* [http://www.open-aurec.com/wbforum/viewtopic.php?t=5441 List of magics for bitboard move generation] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], August 23, 2006
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5452 Fastest Magic Move Bitboard Generator ready to use] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], August 25, 2006
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=5779 Hash Table handling with LMR/Futility pruning] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], October 21, 2006
==2007==
* [http://www.open-aurec.com/wbforum/viewtopic.php?t=6104 SEE with magic bitboards] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], January 24, 2007
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6238 Handling 3-rep/50-move in hash tables] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], February 19, 2007 » [[Repetitions]], [[Transposition Table]]
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6461 Compiling for Unix] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], May 08, 2007 » [[Unix]]
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6558 Slight enhancement to PVS] by [[Pradu Kannan|Pradu]], [[Computer Chess Forums|Winboard Forum]], June 10, 2007 » [[Principal Variation Search]], [[Node Types]]
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6767 A Few General Questions on Parallel Search] by [[Pradu Kannan]], [[Computer Chess Forums|Winboard Forum]], August 31, 2007 » [[Parallel Search]]
==2008==
* [http://www.talkchess.com/forum/viewtopic.php?t=21233 Minimizing Sharing of Data between Physical Processors] by [[Pradu Kannan]], [[CCC]], May 19, 2008
==2009==
* [http://www.talkchess.com/forum/viewtopic.php?t=29434 Questions on volatile keyword and memory barriers] by [[Pradu Kannan]], [[CCC]], August 16, 2009
=References=
<references />
'''[[People|Up one level]]'''
