# ILP Part 76 — Dead ends

This is the seventieth sixth 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 Ślepe zaułki (Dead ends). We have a board with shapes. We need to choose shapes to build a one-lane road … Continue reading ILP Part 76 — Dead ends

# ILP Part 75 — 100 and 13

This is the seventieth fifth 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 100 and 13. We have a board with numbers and we need to find a path with given amount of … Continue reading ILP Part 75 — 100 and 13

# Types and Programming Languages Part 6 – Liskov substitution principle

This is the sixth part of the Types and Programming Languages series. For your convenience you can find other parts in the table of contents in Part 1 — Do not return in finally Today couple words about Liskov substitution princple (LSP for short). It is often misunderstood which leads to unclear directions how to … Continue reading Types and Programming Languages Part 6 – Liskov substitution principle

# ILP Part 74 — Absolute value for real numbers

This is the seventieth fourth part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra We know how to calculate absolute value and how to compare real numbers. The original formula uses comparisons:     where should be an absolute value … Continue reading ILP Part 74 — Absolute value for real numbers

# ILP Part 73 — Matchstick puzzle

This is the seventieth 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’re going to solve a matchstick puzzle. Move one stick to make the equality hold: which is 6 + 2 = 9. Solution is rather … Continue reading ILP Part 73 — Matchstick puzzle