Event: Mech A Boolean

What Is Mech A Boolean-

One line description of Mech A Boolean, as name suggests

 Mechanical Implementation of logic gates

Mech A Boolean is a very interesting competition of implementing logic gates through

mechanical means. There is no restriction on using any kind of mechanical instruments except
for the condition that it should not use any kind of Electrical Energy. Even you can use
household things for example match-sticks, Stationary Items, Ice cream stick or any kind of
junk.

After designing the setup first of all you define different region or a line precisely for different
logic levels for your setup, approaching which your mechanical setup will acquire the logic
levels accordingly.

Constraint

 It is must that you use only static or kinetic energy, as stated above no use of electrical
or magnetic energy is allowed.

Rules Of The Competition

 The problem statement will be given to you one week before the date of competition.

 The problem statement will contain a Boolean expression which you have to implement
with your mechanical gates For example The problem Statement may be as follows

F = A(Ē+C)+CB
  The Output should be accurate according to the declaration of line or region of logic
levels i.e. 1 or 0.

 Not even the final but intermediate output should also be accurate and precised
according to the declaration of line or region of logic levels.

 If two contestants have the accurate results with two different mechanical means, the
better model will be the one with more precision, less complexity and less weight.

 The input action should be unique for one setup and could not be changed afterward.

 The input action will consist of only single motion, no intermediate modification is
allowed.

Following are some example for reference and concept making

Examples

NOT Gate

Truth Table
Input Output

0 1
1 0
As you can see in the above figure, two logic lines or say regions are defined when we pull one
block down to the 1 logic level line as input, we see that the other block touches the above
line i.e. logic level 0 as output. So the truth table proves this setup to be the mechanical
implementation of NOT Gate.

AND Gate

A B Output

0 0 0
0 1 0
1 0 0
1 1 1
As you can see in figure we have a mechanical setup operated with gears and 3 input/output
regions i.e. IN and OUT. Figure justifies the truth table so the above is the mechanical
implementation of AND Gate.

NOTE

It is not necessary that participants copy the ideas shown in the blog, it will be preferable if
they implement the gates in their own style.