{"version":"1.0","type":"link","title":"Backjumping - Newikis","description":"In constraint programming and SAT solving, backjumping (also known as non-chronological backtracking or intelligent backtracking) is an enhancement for backtracking algorithms which reduces the search space. While backtracking always goes up one level in the search tree when all values for a…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/1/1e/Backtracking-no-backjumping.svg/1280px-Backtracking-no-backjumping.svg.png","thumbnail_width":1280,"thumbnail_height":1145}