Bitmasks provide an efficient way to manipulate a set of booleans. By using bitwise operations, boolean flags can be checked, turned on or turned off easily and quickly. It can be used in various algorithms such as the Travelling Salesman Problem to speed up the operation.

All available Bitmask operations are shown here. Select an action and provide the necessary input, and the action will be animated in the visualisation area.

View the visualisation here!

As the action is being carried out, each step will be described in the status panel.

You can also follow the psuedocode highlights to trace the algorithm.

Control the animation with the player controls! Keyboard shortcuts are:
Left/right arrows: step backward/step forward
-/+: decrease/increase speed

Return to "Exploration Mode" to start exploring!