yet another source of inspiration…
In this post, I present a solution to the Rush Hour problem appying A* algorithm developed with ChatGPT. A human programmer would typically use more descriptive data structures to make the code easier to follow. The initial solution didn’t work because the problem instance itself was invalid, but the algorithm was correct. Attempts to prompt… Read more Solving Rush Hour using A*
Over the past few months, I’ve shared a couple of Sudoku solvers here — some built with Dynamic Programming, others with Mixed-Integer Linear Programming (MILP). Both approaches work and are great learning exercises, but they each have their quirks when it comes to constraint formulation: This time, I wanted something cleaner — so I turned… Read more Solving Sudoku with Constraint Programming
In this post, we’re developing a Happy Cube solver using a mixed integer linear program (MILP). Previously, we tackled this problem on a micro:bit using dynamic programming and backtracking. Now, we’re trying a different approach by creating a mathematical model to solve this combinatorial challenge. The idea is to structure the MILP so that it… Read more A MILP based Happy Cube©® Solver
In today’s blog post, let’s dive into the fascinating realm of solving Sudoku puzzles using Mixed Integer Linear Programming (MILP). Check this previous post to see how a sudoku solver can be developed in python using dynamic programming and backtracking. Sudoku, a classic logic-based number placement puzzle, has long captivated minds around the globe with… Read more How to Develop a Sudoku Solver Using Mixed Integer Linear Programming
In this post I’ll demonstrate the results of my most recent fun project on the micro:bit: An app to solve Happy Cubes®, a set of puzzles created in 1986 by the Belgian toy inventor Dirk Laureyssens. My kids were playing with these cubes and I was wondering, if the micro:bit could solve these cubes in… Read more Solving Happy Cubes® on A micro:bit
In this post I want to demonstrate the power of recursive programming by programming a sudoku solver in Python. The complete sourcecode can also be downloaded here. Although I like solving Sudokus by hand, I’m far away from being a professional Sudoku solver. Usually I get the medium-ones solved, however, since I always want to… Read more A Sudoku Solver in a few Lines of Code – Or the Power of Recursive Programming
Some time ago I organized a cubing-event in the quarter and presented the ‘algorithms’ – how move-sequences are called in the cuber-scene – to solve the rubik’s cube using the corners first method based on information provided by Victor Ortega. Here I present the material I developed in order to teach the people this method.… Read more Solving the Rubik’s Cube using corners first method