BrainSnack® Number Clusters Maze
Intro
BrainSnack® Number Clusters Mazes are language-independent, logical numerical problems for young adults and adults. They are semi-automated; the computer is used to ensure that there is only one possible solution.

Directions
Complete the grid by constituting adjoining clusters that consist of as many cubes as the number on the cubes. At cube 5, for instance, you will have to make a five cube cluster. Two or more figure cubes of the same value belong to the same cluster. You can only place your cubes along horizontal and/or vertical lines.





Click on the links below to see some samples.
Availability
We currently have more than 360 Number Clusters for print and website publication, and we can make more upon request. All mazes are available in colour and black and white. The basic languages for the instructions are English, French, and Dutch.

Technical
For each game, we deliver an .rtf-text file for the directions. Graphics are deliverded separately:
  • for print: Illustrator 9.01 EPS vector graphics
  • for websites: 256-colour GIF file




Contact us to request a free 'Member Login'
so you can download our complete catalogues.

Number Clusters Maze Sample 1
ID: CFF020C

Picture

Solution:

Picture


Brain Trainer magazine  Brain Trainer magazine  Japanese puzzlemix magazine  Junior Sudoku magazine  Classic Sudoku magazine  Expert Sudoku magazine  Sudoku Fun magazine  Varia Sudoku magazine  Junior Sudoku magazine  Sudoku Holiday magazine

Brain Trainer magazine  Brain Trainer magazine  Japanese puzzlemix magazine  Junior Sudoku magazine  Classic Sudoku magazine  Expert Sudoku magazine  Sudoku Fun magazine  Varia Sudoku magazine  Junior Sudoku magazine  Sudoku Holiday magazine

Draw with number book  Draw with number book  Futoshiki Kids book  Visual Puzzle book  Futoshiki Volume book Draw with number books  Sudoku Kids book  Visual Puzzle book  Sudoku Volume book
Home   |  About Us   |  Contact Us   |  Member Login
PeterFrank, Postbus 11, 9830 Sint-Martens-Latem, Belgium | Copyright © 2010 - All rights reserved.