Any Mini Project In C

[smt]

hai,
plz any body give simple topic of doing a mini project in C

[sicarie]

hai,
plz any body give simple topic of doing a mini project in C

I would recommend looking at sourceforge.net and freshmeat.net to see what other people have done (and then you'll also get some ideas on the implementation as well)

[weaknessforcats]

Try this:

11001101100011000F1000
0010001000100001011011
1100101011110000100010
110101001000011110100
1110100010101010000101
1101000101000101010100
1101010000100101010100
1101001010101000010100
0100000100101001100010
101S110000101000100001

Display the array so that 0's appear as spaces.
Locate the S and change to it an *
Move the * to the F a position at a time. 1 is blocked 0 is open.
Re-display the array after each move.

[RedSon]

Try this:


110011011000110 00F1000
001000100010000 1011011
110010101111000 0100010
110101001000011 110100
111010001010101 0000101
110100010100010 1010100
110101000010010 1010100
110100101010100 0010100
010000010010100 1100010
101S11000010100 0100001

Display the array so that 0's appear as spaces.
Locate the S and change to it an *
Move the * to the F a position at a time. 1 is blocked 0 is open.
Re-display the array after each move.

Can I move diagonally?

[weaknessforcats]

Can I move diagonally?

The rules don't say one way or another. Most solutions do not move diagonally.

[RedSon]

This mini project is awesome!

[kreagan]

Try this:

11001101100011000F1000
0010001000100001011011
1100101011110000100010
110101001000011110100
1110100010101010000101
1101000101000101010100
1101010000100101010100
1101001010101000010100
0100000100101001100010
101S110000101000100001

Display the array so that 0's appear as spaces.
Locate the S and change to it an *
Move the * to the F a position at a time. 1 is blocked 0 is open.
Re-display the array after each move.

Oooh, a Maze project.

If you are looking for something else, a couple of fun projects I had were:

Sudoku Solver
Queens Problem

[RedSon]

Oooh, a Maze project.

If you are looking for something else, a couple of fun projects I had were:

Sudoku Solver
Queens Problem

Please post them, not the answers just the questions.

[kreagan]

Please post them, not the answers just the questions.

Do you want me to post them here or somewhere else on this site?

[jthep]

Try this:

11001101100011000F1000
0010001000100001011011
1100101011110000100010
110101001000011110100
1110100010101010000101
1101000101000101010100
1101010000100101010100
1101001010101000010100
0100000100101001100010
101S110000101000100001

Display the array so that 0's appear as spaces.
Locate the S and change to it an *
Move the * to the F a position at a time. 1 is blocked 0 is open.
Re-display the array after each move.

This looks like a really cool project. Too bad I'm just a newbie at present. I can proly code up to the first two lines...then the rest, Im clueless.

[RedSon]

This looks like a really cool project. Too bad I'm just a newbie at present. I can proly code up to the first two lines...then the rest, Im clueless.

Go ahead, we'll help you along when you get stuck. Full code posts are okay for this thread.

[kreagan]

Please post them, not the answers just the questions.

Sudoku Solver: Given a text file with the format

5 3 - - 7 - - - -
6 - - 1 9 5 - - -
- 9 8 - - - - 6 - 
8 - - - 6 - - - 3
4 - - 8 - 3 - - 1 
7 - - - 2 - - - 6
- 6 - - - - 2 8 -
- - - 4 1 9 - - 5
- - - - 8 - - 7 9

Create a Sudoku solver to solve this problem. Each row, column, and 3x3 block section should contain the numbers 1 through 9. However, each row, column, and 3x3 block cannot have repetitions of the same number.

For more information (and real solution to the puzzle), look at
Sudoku information

ps. If the program isn't coded efficiently, some puzzles can take hours to solve. Plus there are different algorithms to solve them too (to increase efficiency).

Queens Problem:

The eight queens puzzle is the problem of putting eight chess queens on an 8×8 chessboard such that none of them is able to capture any other using the standard chess queen's moves. The colour of the queens is meaningless in this puzzle. The queens must be placed in such a way that no two queens would be able to attack each other. Thus, a solution requires that no two queens share the same row, column, or diagonal.

Make a program that takes a number n and solves the queens problem for n queens for a board n x n size.