You'll notice that this week's puzzle is fairly easy. That's because it isn't meant to be done using a computer. Instead, take it and do it on a white board or hand writing on a piece of paper. If you've never done this before I'm sure it will surprise you at how hard it is . The point is to practice...

Your challenge this week is to implement basic arithmetic for a different type of number representation. Instead of each bit representing a power of 2, each bit will represent a number. Only one bit will be set in any integer. The first few numbers are: x00000000 0 ...

This week’s contest is to direct a chess knight around a maze. Your job is to find the exit by only using knight moves and by not moving over any walls. The knight must land on the exit to exit the maze. Rules Implement the following function given the prototypes: bool IsWall( int x, int y);...

This week’s contest will be to determine if a graph is 2-colorable. “2-colorable” means that all nodes can be colored with one of two colors such that two nodes that are linked together do not have the same color. Below are examples of graphs which are 2 colorable and which are not. Implement...

Let's have a little contest. The rules are: You must still be in school with a year or less of industry experience. You must email me your answer. You may use any programming language you like. You may use any tools you like to help you find the answer. This will be some good practice...