Talk:Quiescence search

From Wikipedia, the free encyclopedia

	This article is within the scope of WikiProject Chess, a collaborative effort to improve Wikipedia's coverage of chess. For more information, visit the project page, where you can join the project and/or contribute to the discussion.	Chess Portal
Start	This article has been rated as Start-Class on the quality scale.
Mid	This article has been rated as Mid-Importance on the importance scale.

[edit] Need authentic sample game

The example position in the article cannot be from a real game. Black has two bishops on the same color squares, which can only happen via underpromotion, yet black has all eight of his pawns. Thus the position is obviously incorrect. The problem of horizon is a perenial problem in computer search; it should be easy to find examples in the older published literature. --IanOsgood 19:03, 27 November 2006 (UTC)

Fixed, was just some incorrectly specified piece colors. --IanOsgood 20:06, 1 February 2007 (UTC)

The given position is not a very good example of a horizon problem. A blunder is considered to be caused by the horizon problem if a _small_ further search would prevent it. In this case the search would have to be very large. In this case it seems more like a problem with the evaluation of positions by Fritz. Bouke 13:00, 23 February 2007 (UTC)

Well, yes, I believe Fritz is very capable and it just got unlucky. But that was the best example I had when I put that in. ~ Jafet (spam) 16:05, 12 November 2007 (UTC)