This site is being phased out.

# Answers

## Contents

- 1 Algorithm for hexagonal and triangular cells
- 2 Analysis of hands
- 3 Are there inaccessible areas in the maze?
- 4 Can you get from A to B in the maze?
- 5 Compute DDP
- 6 Design a character recognition system
- 7 Graph for vertex-vertex-edge...
- 8 Graph for Gridface
- 9 Implement Reverse
- 10 Is the bone broken?
- 11 Is the membrane penetrable?
- 12 Is there an air-bubble in the alloy?

# Algorithm for hexagonal and triangular cells

Create an article - Algorithm for hexagonal and triangular cells

# Analysis of hands

Should be clear...

# Are there inaccessible areas in the maze?

Consider 1-cycles. If there are more than one 1-cycle, the answer is yes. Run Pixcavator - for this particular image, there is only one 1-cycle...

# Can you get from A to B in the maze?

Consider 1-cycles. If A and B are inside the same 1-cycle, the answer is yes. For this particular image, there is only one 1-cycle...

# Compute DDP

Should be zero, always!

# Design a character recognition system

Contribute to this article Character recognition.

# Graph for vertex-vertex-edge...

# Graph for Gridface

The pixels are added row by row, left to right. In the graph they are numbered according to their coordinates.

# Implement Reverse

# Is the bone broken?

Consider 0-cycles. If there is no 0-cycle that connects top to bottom, the answer is Yes.

# Is the membrane penetrable?

Think about it.

# Is there an air-bubble in the alloy?

Consider 2-cycles.