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
For years, my Android unlock pattern was my fortress — a carefully chosen sequence of swipes that I thought only I could remember. Unfortunately, I underestimated two things: (1) the persistence of children, and (2) their uncanny ability to casually “observe” without being noticed. One day, I realized my long-guarded pattern had been compromised. My… Read more Mobilephone Unlock-Pattern Generator
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
Two Poems by Heinz Erhardt
I dedicate this post to one of my favorite composers, Johann Sebastian Bach. I was walking through Paris years ago when I approached a cathedral where someone had played this piece. It is the fugue of the Bach Toccata, BWV 565. At first, I thought that a virtuos organist must be at work here. Only… Read more micro:bit plays Bach
I owe this task to Ruedi, a regular tennis player. The Tennis Court Problem (TCP) is about the following task. At the beginning of outdoor tennis, the court lines must always be cleaned first. The sweeping set is often placed in one of two typical locations, usually either on one side of the net or… Read more The Tennis Court Problem (TCP)
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 will demonstrate a “Hello, World!” example for the micro:bit to light up some Neopixels. Neopixels are individually-addressable RGB LEDs and can come in various forms. The most common form is the chain having all units connected serially. It was invented by Adafruit, an open-source hardware company based in New York City. Why did I… Read more Neopixels with micro:bit