Severi Salminen, a Finnish Freelance-musician, Master of Music from Sibelius Academy, Helsinki, and avocational software developer and computer chess programmer. He is author of ssRay, an unbiased Monte Carlo path tracing renderer capable of producing very realistic looking images [1], and author of the WinBoard compliant chess engine Requiem [2].
Severi Salminen [3]

Forum Posts

2000

• A free assembler? (A little off topic...) by Severi Salminen, CCC, February 27, 2000
• My program plays chess! by Severi Salminen, CCC, April 08, 2000
• Negamax algorithm?? by Severi Salminen, CCC, April 11, 2000 » Negamax
• Move ordering? by Severi Salminen, CCC, April 28, 2000 » Move Ordering
• C or C++ for Chess Programming? by Severi Salminen, CCC, August 16, 2000
• Deep Thought's tuning code and eval function! by Severi Salminen, CCC, September 05, 2000 » Eval Tuning in Deep Thought
• Alpha-Beta explanation on Heinz's book? by Severi Salminen, CCC, October 05, 2000 » Alpha-Beta ^[4]
• Binary question by Severi Salminen, CCC, October 19, 2000 » BitScan
• An idea to generate rook moves without rotated BBs by Severi Salminen, CCC, October 22, 2000
• Where is Principal Variation? by Severi Salminen, CCC, November 22, 2000 » Principal Variation
• What is Negascout and why is MWS PVS? by Severi Salminen, CCC, November 24, 2000 » NegaScout, Principal Variation Search
• Qsearch problems...(about sorting and SEE) by Severi Salminen, CCC, November 26, 2000 » Quiescence Search, Static Exchange Evaluation
• MVV/LVA or SEE - liability? by Severi Salminen, CCC, November 29, 2000 » MVV-LVA
• Something wrong with my futility pruning? by Severi Salminen, CCC, December 05, 2000 » Futility Pruning
• About history heuristics, killers and my futil. pruning code by Severi Salminen, CCC, December 06, 2000 » History Heuristic, Killer Heuristic

2001

• About SEE by Severi Salminen, CCC, January 04, 2001
• Correct values if all moves are pruned? by Severi Salminen, CCC, January 05, 2001 » Pruning
• Can nullmoves behave like this? by Severi Salminen, CCC, January 08, 2001 » Null Move Pruning
• How to extend if only one reply? by Severi Salminen, CCC, January 23, 2001 » One Reply Extensions
• A story about NPS by Severi Salminen, CCC, January 26, 2001 » Nodes per second
• Should an engine using SEE beat another not using it? by Severi Salminen, CCC, January 27, 2001
• Definition of branching factor? by Severi Salminen, CCC, January 30, 2001 » Branching Factor
• What means lazy/plain alpha bounding? by Severi Salminen, CCC, February 06, 2001 » Fail-High, Root
• Please explain the difference between PVS and NegaScout by Severi Salminen, CCC, March 02, 2001 » NegaScout, Principal Variation Search
• A few hashing questions by Severi Salminen, CCC, December 02, 2001 » Pawn Hash Table
• About random numbers and hashing by Severi Salminen, CCC, December 04, 2001 » Zobrist Hashing
• Crafty's 32-bit pawn hash collision figures? by Severi Salminen, CCC, December 06, 2001 » Crafty, Pawn Hash Table
• Requiem (a WinBoard compatible engine) RELEASED! by Severi Salminen, CCC, December 09, 2001
• About qsearch... by Severi Salminen, CCC, December 27, 2001 » Quiescence Search
• About limiting Qsearch, again... by Severi Salminen, CCC, December 29, 2001
• Qsearch survey by Severi Salminen, CCC, December 30, 2001

2002

• Reply from Intel about BSF/BSR by Severi Salminen, CCC, January 31, 2002 » BitScan
• Requiem v0.53 released by Severi Salminen, CCC, September 26, 2002

External Links

• Severi Salminen - Google+
• Homepage of Severi Salminen
• Homepage of Severi Salminen - Requiem
• Homepage of Severi Salminen - ssRay

References

1. ^ Homepage of Severi Salminen - ssRay
2. ^ Homepage of Severi Salminen - Requiem
3. ^ Severi Salminen - Google+
4. ^ Ernst A. Heinz (1999). Scalable Search in Computer Chess. Morgan Kaufmann, ISBN 3-528-05732-7

What links here?