c语言程序农夫过河,农夫过河2(c语言).docx

#include typedef int DataType;

//顺序队列：类型和界面函数声明

struct SeqQueue

{

// 顺序队列类型定义

int MAXNUM; // 队列中最大元素个数

int f, r;

DataType *q;

};

typedef struct SeqQueue *PSeqQueue; // 顺序队列类型的指针类型

PSeqQueue createEmptyQueue_seq(int m)

{

//创建一个空队列

PSeqQueue queue = (PSeqQueue)malloc(sizeof(struct SeqQueue));

if (queue != NULL)

{

queue->q = (DataType*)malloc(sizeof(DataType) *m);

if (queue->q)

{

queue->MAXNUM = m;

queue->f = 0;

queue->r = 0;

return (queue);

}

else

free(queue);

}

printf("Out of space!!/n"); // 存储分配失败

return NULL;

}

int isEmptyQueue_seq(PSeqQueue queue)

{

//判断队列是否为空

return (queue->f == queue->r);

}

void enQueue_seq(PSeqQueue queue, DataType x)

// 在队尾插入元素x

{

if ((queue->r + 1) % queue->MAXNUM == queue->f)

printf("Full queue./n");

else

{

queue->q[queue->r] = x;

queue->r = (queue->r + 1) % queue->MAXNUM;

}

}

void deQueue_seq(PSeqQueue queue)

// 删除队列头部元素

{

if (queue->f == queue->r)

printf("Empty Queue./n");

else

queue->f = (queue->f + 1) % queue->MAXNUM;

}

DataType frontQueue_seq(PSeqQueue queue)

{

if (queue->f == queue->r)

printf("Empty Queue./n");

else

return (queue->q[queue->f]);

}

//个体状态判断函数

int farmer(int location)

{

//判断农夫的位置

return (0 != (location &0x08));

}

int wolf(int location)

{

//判断狼的位置

return (0 != (location &0x04));

}

int cabbage(int location)

{

//判断白菜的位置

return (0 != (location &0x02));

}

int goat(int location)

{

//判断羊的位置

return (0 != (location &0x01));

}

//安全状态的判断函数

int safe(int location)

{

// 若状态安全则返回true

if ((goat(location) == cabbage(location)) && (goat(location) != farmer

(location)))

return (0);

// 羊吃白菜

if ((goat(location) == wolf(location)) && (goat(location) != farmer

(location)))

return (0);

// 狼吃羊

return (1); // 其他状态是安全的

}

main()

{

int i, movers, location, newlocation;

int route[16]; //用于记录已考虑的状态路径

PSeqQueue moveTo; //用于记录可以安全到达的中间状态

moveTo = createEmptyQueue_seq(20); //创建空队列

enQueue_seq(moveTo, 0x00); //初始状态进队列

for (i = 0; i < 16; i++)

route[i] = - 1;

//准备数组route初值

route[0] = 0;

while (!isEmptyQueue_seq(moveTo) && (route[15] == - 1))

{

location = frontQueue_seq(moveTo); //取队头状态为当前状态

deQueue_seq(moveTo);

for (movers = 1; movers <= 8; movers <<= 1)

//考虑各种物品移动

if ((0 != (location &0x08)) == (0 != (location &movers)))

//农夫与移动的物品在同一侧

{

newlocation = location ^ (0x08 | movers); //计算新状态

if (safe(newlocation) && (route[newlocation] == - 1))

//新状态安全且未处理

{

route[newlocation] = location; //记录新状态的前驱

enQueue_seq(moveTo, newlocation); //新状态入队

}

}

}

// 打印出路径

if (route[15] != - 1)

//到达最终状态

{

printf("The reverse path is : /n");

for (location = 15; location >= 0; location = route[location])

{

printf("The location is : %d/n", location);

if (location == 0)

exit(0);

}

}

else

printf("No solution./n");

//问题无解

}