Null Move
Called the "null move" technique, it tells the engine to "pass" for one side. That is, to evaluate a position as if one player could make two moves in a row. If the position has not improved even after moving twice, then it can be assumed that the first move is a dud and can be quickly discarded from the search tree, reducing its size and making the search more efficient. Null moves were used in some of the earliest chess programs, including the Soviet Kaissa. It's elegant and a little ironic that algorithms designed on the principle of exhaustive search are augmented by being less exhaustive.
Notes:
Folksonomies: algorithms
Taxonomies:
/business and industrial/business operations (0.614186)
/business and industrial/business software (0.612345)
/technology and computing/programming languages (0.609529)
Keywords:
Null Move (0.991721 (:0.000000)), Null moves (0.682511 (:0.000000)), first move (0.645912 (:0.000000)), position (0.610955 (:0.000000)), moves (0.569489 (:0.000000)), search tree (0.544728 (:0.000000)), player (0.527068 (:0.000000)), earliest chess programs (0.523921 (:0.000000)), algorithms (0.523086 (:0.000000)), technique (0.522292 (:0.000000)), size (0.518367 (:0.000000)), search (0.517125 (:0.000000)), engine (0.515168 (:0.000000)), row (0.510319 (:0.000000)), side (0.510319 (:0.000000)), principle of exhaustive search (0.473374 (:0.000000)), Soviet Kaissa (0.415231 (:0.000000)), pass (0.350522 (:0.000000))
Entities:
Soviet Kaissa:Location (0.918074 (:0.000000))
Concepts:
Computer chess (0.987616): dbpedia_resource
Chess engine (0.751133): dbpedia_resource
World Computer Chess Championship (0.715291): dbpedia_resource
Null-move heuristic (0.711182): dbpedia_resource
Computer program (0.691366): dbpedia_resource
Chess (0.671990): dbpedia_resource
Kaissa (0.634014): dbpedia_resource
Russia (0.590490): dbpedia_resource
Deep Thinking: Where Machine Intelligence Ends and Human Creativity Begins