Adding sticks Stick arithmetic is probably the easiest to implement with a Turing machine. The collection to use is C={ ☐, |, X, =, +}. We write an addition on the strip with sticks, for example: ||||+||= The result should be of the form: ||||+||=|||||| Start on the = sign or on the stick immediately […]
Learning to count, discovering numbers: the decimal number domino can provide a visual aid to this learning process. This article explains the pedagogical principles behind this tool and suggests a few activities. Warning The teaching guidelines given here are general. Whether you use them with dominoes or not, you can apply them to all other […]
How to use decimal dominoes to learn tens and counting to 100. That’s it, the pupils are counting to 10. They are used to adding and removing tokens one by one. They can count up from a pile of 5 and even create numbers by removing a few tokens, such as obtaining a 9 from […]
The examples presented in this article are for three-domino bars, which use numbers greater than 100, which allows us to understand carryover passages. Of course, we can use fewer dominoes to work on addition. If S is the sum of terms a and b : S <= 10: two unit domino bars are enough (there […]
As with addition, the examples presented in this article involve numbers greater than 100. It is of course possible to use dominoes with numbers less than 100. Subtraction Subtraction is not commutative: a – b ≠ b – a. The operand a is the one from which we will subtract the value b . If […]
What are you looking for ? Techniques for solving integrams Find universal techniques for solving integrams , regardless of the medium (web, paper, etc.) Use the Actilud site editor to solve an integram How to use the editor and its advanced features , to solve any integram. Use the Actilud zebra puzzle editor to create […]
How to solve any zebra puzzle from a magazine? Use our solver ! The zebra puzzle editor on Actilud has two functions: solver designer Solver mode allows you to solve a puzzle taken from a magazine. This mode does not use the statements; it starts from the distribution of signs on the grid and calculates […]
Let’s use the Actilud website’s zebra puzzle editor to create a puzzle in three steps. Have you ever tried to create a zebra puzzle yourself? It’s not easy, is it? There’s a lot of checking to be done! After all, it’s not enough just to write down different logical propositions. They must not contradict each […]
Solver 2.0 is more powerful than the previous version. New features include solution rotation, which allows for a better understanding of the reasoning behind the solution. Rotation of solutions Some players on Actilud use the step-by-step solver to learn how to solve zebra puzzles. It’s a very good idea. But it’s sometimes difficult to understand […]
Introduction to Booleans A Boolean is a two-state variable, which is generally assigned the values true or false. In a zebra puzzle, the use of Booleans allows us to identify boxes whose behavior follows the same rules: the boxes identified by the same Boolean are either all true or all false. Thanks to them, a […]
The complement technique is the simplest basic technique. Presence of a true sign When there is a true sign in a grid, we can complete the boxes in the corresponding row and column with false signs. By the very definition of the integram, there can only be one true sign per row and per column. […]
The square is one of the simple solving techniques that works within a grid. Finding them requires a keen eye! The principle Some false sign configurations can leave empty boxes on rows, boxes which must contain a true sign : Look at the yellow boxes forming a square: there must be at least one true […]
Repercussion is one of the most powerful and simplest techniques to implement when a zebra puzzle has multiple grids. It starts with a true sign on a central grid and projects an entire row into another grid. The row can contain false signs, true signs, and even Booleans. True sign on a central grid The […]
Merging is the inverse of repercussion. The technique can find pivot cells that are false, and, in some cases with Booleans, true cells . Two rows can produce a false pivot cell if combining the two rows results in a false row. NB: You must have a good understanding of the repercussion technique before tackling […]
Alternatives are the starting point for many techniques. This section does not cover any specific technique, but explains the principle of the alternative, which will be reused in specific techniques. In a statement, alternatives are mutually exclusive propositions. Simple case: in a grid Alice wears a blue, red or green swimsuit. The expression or corresponds […]
This technique is quite obvious. It works from an alternative. If a row contains an alternative, i.e., false signs and Booleans, with no empty cells, then rows containing an empty cell with the same number of false signs and the same Booleans, except one, can be completed with the missing Boolean.
by