I am despairing an urgently seeking for help.

I must use and change the code (1) written in C, in order to solve the
problem 2.

I count on some kind programmer to help me.

I would like that it is very urgent for me to solve this problem and you

Thank you in advance

CODE (1)

//----------------------------------------------------------
//
// play
//
//----------------------------------------------------------
#include <stdio.h>
#include <conio.h>

#define true 1
#define false 0

#define STAMPAPASSI

typedef int bool;

void initMatrice(int m[10][10]);
void stampaMatrice(int m[10][10]);

bool convalida ( int riga, int colonna, int m[10][10] );
bool vinto(int m[10][10]);
bool muovi(int riga, int colonna, int matrice[10][10], int numero);

void main(void)
{
char x;
int matrice[10][10];

initMatrice(matrice);

if (muovi(0,0,matrice,0) == true) {
printf("Game over");

x = getch();

void initMatrice(int m[10][10])
{
int i;
int j;

for(i=0;i<10;i++)
{
for(j=0;j<10;j++)
{
m[i][j] = 0;

for(i=0;i<10;i++)
{
for(j=0;j<10;j++)
{
printf("%4d",m[i][j]);

bool convalida(int riga,int colonna,int m[10][10])
{
if( riga < 0 || riga > 9 || colonna < 0 || colonna > 9)
{
return false;

returned value
True: the function arrived to 100
False: the function is not able to make a move
*/

bool muovi(int riga, int colonna, int matrice[10][10], int numero)
{

// first of all I must check whether the postion where I've been sent is
inside the game field //and is free

if (convalida(riga, colonna, matrice) == false) return false;

// I define at which number of the recorsive I am

// I write my position on the matrix
matrice[riga][colonna] = numero;

#ifdef STAMPAPASSI
stampaMatrice(matrice);
#endif

// if I am at the recorsive function 100 the game is over and all the
moves are correct
if (numero == 100) return true;

//I try to move nortwards
if (muovi(riga-3,colonna, matrice, numero) == true){
//Game over I reached 100
return true;

matrice[riga][colonna] = 0;
return false;

given the matrix char 10x10:

| 0123456789
-+-----------
|
0| 000000*000
1| *****0***0
3| *00000*000
4| 00******0*
5| 0****0000*
6| 000000***0
7| ***0***000
8| 00*00*000*
9| ****000*00

Here is the matrix

<snip>

Cheers,
Dave.

I do not understand why but I am not able to fit the first code to the second
problem. I am am newbie....that could be an explanation !!!
Could you please help me? :-)

By the way the right matrix is:

0| 000000*000
1| *****0***0
2|***0***0***
3| *00000*000
4| 00******0*
5| 0****0000*
6| 000000***0
7| ***0***000
8| 00*00*000*
9| ****000*00

   0123456789
-+-----------
0| 000000*000
1| *****0***0
2| ***0***0**
3| *00000*000
4| 00******0*
5| 0****0000*
6| 000000***0
7| ***0***000
8| 00*00*000*
9| ****000*00

IIRC, the original problem (corrected for 0-based indexing :)) was how to
get from (0,0) to (9,9), moving only through "0" cells, considering "*"
cells to be barriers to movement.  With the addition of row 2, I don't see
how that's possible; seems you can get as far as (5,1), and that's it.
Is quantum tunneling allowed? :)

Let me guess: there's another error waiting to be corrected.

The problem itself may teach you something about programming, but be
sure to also pay attention to the implicit lesson in the importance
of accuracy, embodied in all these back-and-forth corrections!  ;)

--Ben

while we're not finished,
  mark current square as visited
  check, in order, the squares n, ne, e, se, s, sw, w, nw for a
    square which has not yet been visited
  if we have an unvsited square,
    go there.
  otherwise,
    mark this square as a dead end
    check, in order, the squares n, ne, e, se, s, sw, w, nw for a
      square which has been visited and is not a dead end
    if we have a non-dead-end,
      go there.
    otherwise
      give up and come up with a better algorithm, or concede
      that there is no path to the finish.
    end if
  end if
end while

Now all you have to do is implement that algorithm with the code
you have.

Cheers,
Dave.