This is the sixtieth fourth part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Last time we actually implemented BFS-like algorithm in the graph with ILP which can be also used for testing graph connectivity (if two nodes are connected … Continue reading ILP Part 64 – BFS, graph connectivity, spanning tree

This is the sixtieth third part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Today we are going to solve Surasshupakku riddle. We have a board with letters on it and we need to cut the board in a way … Continue reading ILP Part 63 – Surasshupakku

This is the sixtieth second part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Today we are going to solve a chess problem variation. We want to generate a chess board (with regular pieces for each player) with maximal attacking … Continue reading ILP Part 62 – Maximally attacking chessboard