閆偉明（人工智能實(shí)驗(yàn)3）

1、精選優(yōu)質(zhì)文檔-傾情為你奉上精選優(yōu)質(zhì)文檔-傾情為你奉上專心-專注-專業(yè)專心-專注-專業(yè)精選優(yōu)質(zhì)文檔-傾情為你奉上專心-專注-專業(yè) 人工智能 上機(jī)實(shí)驗(yàn)報(bào)告學(xué)號(hào)： 姓名： 閆偉明 所在系： 信息學(xué)院 班級(jí)： 惠普測(cè)試142班 實(shí)驗(yàn)名稱： 知識(shí)表示方法及應(yīng)用 實(shí)驗(yàn)日期 2016年12月3日 實(shí)驗(yàn)指導(dǎo)教師 李輝 實(shí)驗(yàn)機(jī)房 A401 -實(shí)驗(yàn)?zāi)康模涸谡莆諣顟B(tài)空間搜索策略的基礎(chǔ)上，理解知識(shí)表示的方法。能夠應(yīng)用知識(shí)表示方法，解決實(shí)際問題。實(shí)驗(yàn)內(nèi)容：(1) M-C問題描述有n個(gè)牧師和n個(gè)野人準(zhǔn)備渡河，但只有一條能容納c個(gè)人的小船，為了防止野人侵犯牧師，要求無論在何處，牧師的人數(shù)不得少于野人的人數(shù)(除非牧師人數(shù)為0

2、)，且假定野人與牧師都會(huì)劃船，試設(shè)計(jì)一個(gè)算法，確定他們能否渡過河去，若能，則給出小船來回次數(shù)最少的最佳方案。(2) 基本要求：輸入：牧師人數(shù)(即野人人數(shù))：n；小船一次最多載人量：c。輸出：若問題無解，則顯示Failed，否則，顯示Successed輸出一組最佳方案。用三元組(X1, X2, X3)表示渡河過程中的狀態(tài)。并用箭頭連接相鄰狀態(tài)以表示遷移過程：初始狀態(tài)-中間狀態(tài)-目標(biāo)狀態(tài)。例：當(dāng)輸入n=2，c=2時(shí)，輸出：221-110-211-010-021-000其中：X1表示起始岸上的牧師人數(shù)；X2表示起始岸上的野人人數(shù)；X3表示小船現(xiàn)在位置(1表示起始岸，0表示目的岸)。要求：寫出算法的設(shè)

3、計(jì)思想和源程序，并以圖形用戶界面實(shí)現(xiàn)人機(jī)交互，進(jìn)行輸入和輸出結(jié)果，如：Please input n: 2 Please input c: 2Successed or Failed?: SuccessedOptimal Procedure: 221-110-211-010-021-000算法設(shè)計(jì)package cn.xiaoyangege.mvc.yerenguohe;/CrossRiverQuestion.javaimport java.util.ArrayList;import java.util.List;import java.util.Scanner;public class Cros

4、sRiverQuestion public static void main(String args) Scanner scanner = new Scanner(System.in);int n = 0;int c = 0;String ns = null;String cs = null;boolean flag;do flag = false;System.out.print(Please input n:);ns = scanner.nextLine();System.out.print(Please input c:);cs = scanner.nextLine();try n =

5、Integer.parseInt(ns);c = Integer.parseInt(cs); catch (NumberFormatException e) System.out.println(輸入不合法。);flag = true;continue;if (!flag & (n 0 | c 0) System.out.println(輸入不合法。);flag = true; while (flag);scanner.close();CrossRiverQuestion q = new CrossRiverQuestion(n, c);q.solveQuestion();private in

6、tpeoNum;private intsavageNum;private ListresultList= new ArrayList();public List solveQuestion() Node n = new Node(peoNum, savageNum, 0, 0, 0, new ArrayList(),0, 0);boolean dfsResult = dfs(n);System.out.print(Succeed or Failed?: );if (dfsResult) System.out.println(Succeed.);System.out.print(Optimal

7、Procedure: );resultList.add(0, n);for (Node node : resultList) System.out.print(node.getLeftPeo() + + node.getLeftSavage()+ + (1 - node.getCURR_STATE() + -);System.out.println(End);return resultList; else System.out.println(Failed.);return null;public CrossRiverQuestion(int peoNum, int savageNum) su

8、per();this.peoNum = peoNum;this.savageNum = savageNum;private boolean dfs(Node n) if (n.hasVisited() return false;n.addCheckSum();if (n.getLeftPeo() = 0 & n.getLeftSavage() = 0) return true;if (n.getLeftPeo() 0 | n.getRightPeo() 0 | n.getLeftSavage() 0| n.getRightSavage() 0) return false;if (n.getLe

9、ftPeo() 0) return false;if (n.getRightPeo() 0) return false;if (n.getCURR_STATE() = n.getStateBoatLeft() Node n1 = new Node(n.getLeftPeo() - 1, n.getLeftSavage() - 1,n.getRightPeo() + 1, n.getRightSavage() + 1,n.getStateBoatRight(), n.getNodesCheckSum(), 1, 1);if (dfs(n1) resultList.add(0, n1);retur

10、n true;Node n4 = new Node(n.getLeftPeo() - 2, n.getLeftSavage(),n.getRightPeo() + 2, n.getRightSavage(),n.getStateBoatRight(), n.getNodesCheckSum(), 2, 0);if (dfs(n4) resultList.add(0, n4);return true;Node n5 = new Node(n.getLeftPeo(), n.getLeftSavage() - 2,n.getRightPeo(), n.getRightSavage() + 2,n.

11、getStateBoatRight(), n.getNodesCheckSum(), 0, 2);if (dfs(n5) resultList.add(0, n5);return true; else Node n6 = new Node(n.getLeftPeo(), n.getLeftSavage() + 1,n.getRightPeo(), n.getRightSavage() - 1,n.getStateBoatLeft(), n.getNodesCheckSum(), 0, 1);if (dfs(n6) resultList.add(0, n6);return true;Node n

12、7 = new Node(n.getLeftPeo() + 1, n.getLeftSavage(),n.getRightPeo() - 1, n.getRightSavage(),n.getStateBoatLeft(), n.getNodesCheckSum(), 1, 0);if (dfs(n7) resultList.add(0, n7);return true;Node n1 = new Node(n.getLeftPeo() + 1, n.getLeftSavage() + 1,n.getRightPeo() - 1, n.getRightSavage() - 1,n.getSta

13、teBoatLeft(), n.getNodesCheckSum(), 1, 1);if (dfs(n1) resultList.add(0, n1);return true;Node n4 = new Node(n.getLeftPeo() + 2, n.getLeftSavage(),n.getRightPeo() - 2, n.getRightSavage(),n.getStateBoatLeft(), n.getNodesCheckSum(), 2, 0);if (dfs(n4) resultList.add(0, n4);return true;Node n5 = new Node(

14、n.getLeftPeo(), n.getLeftSavage() + 2,n.getRightPeo(), n.getRightSavage() - 2,n.getStateBoatLeft(), n.getNodesCheckSum(), 0, 2);if (dfs(n5) resultList.add(0, n5);return true;return false;public List getResultList() return resultList;class Node private ListnodesCheckSum= new ArrayList();private intle

15、ftPeo;private intrightPeo;private intleftSavage;private intrightSavage;private intCURR_STATE= 0;private intonBoatPeoNum= 0;private intonBoatSavageNum= 0;private final intSTATE_BOAT_LEFT= 0;private final intSTATE_BOAT_RIGHT= 1;public Node(int leftPeo, int leftSavage, int rightPeo, int rightSavage,int

16、 state, List checkSumList, int onBoatPeoNum,int onBoatSavageNum) CURR_STATE = state;this.leftPeo = leftPeo;this.leftSavage = leftSavage;this.rightPeo = rightPeo;this.rightSavage = rightSavage;nodesCheckSum.addAll(checkSumList);this.onBoatPeoNum = onBoatPeoNum;this.onBoatSavageNum = onBoatSavageNum;p

17、ublic int getLeftPeo() return leftPeo;public void setLeftPeo(int leftPeo) this.leftPeo = leftPeo;public int getRightPeo() return rightPeo;public void setRightPeo(int rightPeo) this.rightPeo = rightPeo;public int getLeftSavage() return leftSavage;public void setLeftSavage(int leftSavage) this.leftSav

18、age = leftSavage;public int getRightSavage() return rightSavage;public void setRightSavage(int rightSavage) this.rightSavage = rightSavage;Overridepublic String toString() return leftPeo + , + leftSavage + , + rightPeo + , + rightSavage+ , + CURR_STATE;public int getCURR_STATE() return CURR_STATE;pu

19、blic void setCURR_STATE(int cURR_STATE) CURR_STATE = cURR_STATE;public int getStateBoatLeft() return STATE_BOAT_LEFT;public int getStateBoatRight() return STATE_BOAT_RIGHT;public int calcCheckSum() return 1 * getCURR_STATE() + 10 * getLeftPeo() + 100 * getLeftSavage()+ 1000 * getRightPeo() + 10000 * getRightSavage();public void addCheckSum() int checkSum = calcCheckSum();nodesCheckSum.add(checkSum);public boolean hasVisited() int sum = calcCheckSum();for (Integer checkSum : nodesCheckSum) if (checkSum = sum) return true;return false;public List getNodesCheckSum() return n