Taming the Knight's Tour: Minimizing Turns and Crossings

04/04/2019
by   Juan Jose Besa, et al.
0

We introduce two new metrics of simplicity for knight's tours: the number of turns and the number of crossings. We give a novel algorithm that produces tours with 9.5n+O(1) turns and 13n+O(1) crossings on a n× n board. We show lower bounds of (6-ε)n, for any ε>0, and 4n-O(1) on the respective problems of minimizing these metrics. Hence, we achieve approximation ratios of 19/12+o(1) and 13/4+o(1). We generalize our techniques to rectangular boards, high-dimensional boards, symmetric tours, odd boards with a missing corner, and tours for (1,4)-leapers. In doing so, we show that these extensions also admit a constant approximation ratio on the minimum number of turns, and on the number of crossings in most cases.

READ FULL TEXT

page 7

page 21

page 27

research
05/08/2019

Bounding distributional errors via density ratios

We present some new and explicit error bounds for the approximation of d...
research
03/08/2018

Some Approximation Bounds for Deep Networks

In this paper we introduce new bounds on the approximation of functions ...
research
08/29/2023

Lower Bounds on Number of QAOA Rounds Required for Guaranteed Approximation Ratios

The quantum alternating operator ansatz (QAOA) is a heuristic hybrid qua...
research
04/16/2012

Hardness Results for Approximate Pure Horn CNF Formulae Minimization

We study the hardness of approximation of clause minimum and literal min...
research
03/02/2022

Reachability of turn sequences

A turn sequence of left and right turns is realized as a simple rectilin...

Please sign up or login with your details

Forgot password? Click here to reset