Home *People * Severi Salminen

Severi Salminen^[1]

Severi Salminen,
a Finnish professional violinist,master of music fromSibelius Academy,Helsinki, computer scientist with B.Sc. and M.Sc. degrees fromAalto University in 2016 and 2019 respectively^[2], and software developer and former computer chess programmer. He is author of ssRay, an unbiasedMonte Carlopath tracingrenderer capable of producing very realistic looking images^[3], and author of theWinBoard compliant chess engineRequiem^[4].

Forum Posts

2000

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

2001

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

2002

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

External Links

• Severi Salminen | LinkedIn
• sevesalm (Severi Salminen) · GitHub
• Homepage of Severi Salminen (old)
• Homepage of Severi Salminen - Requiem
• Bugfree

References

Up one level

• Musician
• Violinist
• Chess Programmer