1、实 验 报 告课程名称 人工智能 实验项目 圆盘问题 实验仪器 PC 系 别_ _专 业_ _班级/学号 学生姓名 _ 实验日期 _ _ 成 绩 _一、 实验目的理解并熟悉掌握深度优先搜索和广度优先搜索地方法。二、 实验内容设有 3 个大小不等的圆盘 A,B,C 套在一根轴上，每个圆盘上都标有数字1、 2、 3、4，并且每个圆盘都可以独立的绕轴做逆时针转动，每次转动 90 度，初始状态 S0 和目标状态 Sg，用深度优先搜索和广度优先搜索求从 S0 到 Sg 的路径。三、代码和结果/*/圆盘转动问题：有三个圆盘，每个可独自逆时针转动，每次转动/*#include #include “stdio
2、.h“typedef struct TNode_int64 data;TNode* LChild;TNode* RChild;node;/把所以状态列出来，以右边为基准，则初态为，终态为_int64 Node64=123412341234,123412344123,123412343412,123412342341,123441231234,123441234123,123441233412,123441232341,123434121234,123434124123,123434123412,123434122341,123423411234,123423414123,12342341341
3、2,123423412341,341212341234,341212344123,341212343412,341212342341,341241231234,341241234123,341241233412,341241232341,341234121234,341234124123,341234123412,341234122341,341223411234,341223414123,341223413412,341223412341,412312341234,412312344123,412312343412,412312342341,412341231234,412341234123
4、,412341233412,412341232341,412334121234,412334124123,412334123412,412334122341,412323411234,412323414123,412323413412,412323412341,234112341234,234112344123,234112343412,234112342341,234141231234,234141234123,234141233412,234141232341,234134121234,234134124123,234134123412,234134122341,234123411234,
5、234123414123,234123413412,234123412341;/在空二叉树或二叉树中插入一个新的结点node* Insert(node* root,_int64 value)node* current; node* parent; node* new_node; new_node=(node*)malloc(sizeof(node); new_node-data=value;new_node-LChild=NULL;new_node-RChild=NULL;if(root=NULL) return new_node;elsecurrent=root;while(current!
6、=NULL) parent=current;if(current-data value) current=current-LChild;elsecurrent=current-RChild; if(parent-datavalue) parent-LChild=new_node;elseparent-RChild=new_node;return root; /创建一棵新二叉树node* Create(_int64* data,int len)node* root=NULL;int i;for(i=0;idata!=412312342341)printf( “%I64u-“,root-data)
7、;PreOrder(root-LChild);PreOrder(root-RChild);/广度优先搜索void Level(node* root)const int maxsize=64;node* Queenmaxsize;node* current=NULL;int rear=0;int fore=0;if(root!=NULL)rear=(rear+1)%maxsize;Queenrear=root;while(fore!=rear)fore=(fore+1)%maxsize;current=Queenfore;printf( “%I64u-“,current-data);if(cur
8、rent-LChild!=NULLQueenrear=current-LChild;if(current-RChild!=NULLQueenrear=current-RChild;int main(int argc, char* argv)node* root=NULL;root=Create(Node,64);printf(“深度优先搜索：n“);PreOrder(root);printf(“412312342341“);printf(“n广度优先搜索：n“);Level(root);printf(“412312342341n“); return 0;实验心得：对人工智能编程有了初步的了解。
