minimization – Tarik Billa

Algorithm for ordering data so that neighbor elements are as identical as possible

May 23, 2023 by Tarik

Unfortunately, this problem is NP-complete. You can show this by a reduction from the Hamiltonian path problem on planar 3-regular bipartite graphs, which is also NP-complete. As an overview of the proof: we will create a 3-Tuple for each vertex of our graph, such that pairs of corresponding 3-Tuples have dissimilarity equal to 2 if … Read more

Knight’s Shortest Path on Chessboard

January 2, 2023 by Tarik

EDIT: See simon’s answer, where he fixed the formula presented here. Actually there is an O(1) formula This is an image that I’ve made to visualize it ( Squares a knight can reach on Nth move are painted with same color ). Can you notice the pattern here? Although we can see the pattern, it … Read more