{
    "componentChunkName": "component---src-templates-note-note-js",
    "path": "/notes/principal-variaion-search",
    "result": {"data":{"mdx":{"body":"var _excluded = [\"components\"];\nfunction _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n/* @jsxRuntime classic */\n/* @jsx mdx */\n\nvar _frontmatter = {};\nvar layoutProps = {\n  _frontmatter: _frontmatter\n};\nvar MDXLayout = \"wrapper\";\nreturn function MDXContent(_ref) {\n  var components = _ref.components,\n    props = _objectWithoutProperties(_ref, _excluded);\n  return mdx(MDXLayout, _extends({}, layoutProps, props, {\n    components: components,\n    mdxType: \"MDXLayout\"\n  }), mdx(\"p\", null, \"Principal Variation Search is an optimization of alpha-beta pruning where the engine searches the most promising move (the \\u201Cprincipal variation\\u201D) fully, but then searches all other moves with a reduced \\u201C\", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"/notes/null-window\",\n    \"title\": \"null window\"\n  }, \"null window\"), \"\\u201D to quickly detect if they are worse. If a move unexpectedly beats the \", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"/notes/principal-variation\",\n    \"title\": \"principal variation\"\n  }, \"principal variation\"), \", the engine \", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"/notes/re-searches-it-in-full\",\n    \"title\": \"re-searches it in full\"\n  }, \"re-searches it in full\"), \". This hybrid method cuts down the number of \", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"/notes/nodes-explored\",\n    \"title\": \"nodes explored\"\n  }, \"nodes explored\"), \" while still guaranteeing exact results, because \", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"/notes/most-moves-are-inferior\",\n    \"title\": \"most moves are inferior\"\n  }, \"most moves are inferior\"), \" and \", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"/notes/can-be-disproven-with-minimal-effort\",\n    \"title\": \"can be disproven with minimal effort\"\n  }, \"can be disproven with minimal effort\"), \". PVS is one of the core techniques that allow engines to reach high depths without exponential slowdown.\"));\n}\n;\nMDXContent.isMDXComponent = true;","inboundReferences":[]}},"pageContext":{"slug":"principal-variaion-search","node":{"childMdx":{"slug":"principal-variaion-search"}}}},
    "staticQueryHashes": []}