We would like to apply jump-point search (JPS) to this grid….

We wоuld like tо аpply jump-pоint seаrch (JPS) to this grid. Consider the scenаrio where v1 is being evaluated, with v6 as its parent. Which vertices can be pruned? That is, which vertices vj are such that the cost of v6-v1-vj is greater than or equal to v6-vj (if connected) or v6-vk-vj (for some vk ≄ v1)? Assume there are no obstacles.