文件名称:Three_digit_puzzel
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:6.09kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
We are given two 3-digit numbers called S (start) and G (goal), and also a set of 3-digit numbers called
forbidden. To solve the puzzle, we want to get from S to G in the fewest possible moves. A move consists
of transforming a number into another by adding or subtracting 1 to one of its digits. For example, a move
can take you from 123 to 124, or from 953 to 853. Moves are subjects to the following constraints:
• You cannot add to the digit 9 or subtract from the digit 0
• You cannot make a move that transforms the current number into one of the forbidden numbers
• You cannot change the same digit twice in two successive moves.-We are given two 3-digit numbers called S (start) and G (goal), and also a set of 3-digit numbers called
forbidden. To solve the puzzle, we want to get from S to G in the fewest possible moves. A move consists
of transforming a number into another by adding or subtracting 1 to one of its digits. For example, a move
can take you from 123 to 124, or from 953 to 853. Moves are subjects to the following constraints:
• You cannot add to the digit 9 or subtract from the digit 0
• You cannot make a move that transforms the current number into one of the forbidden numbers
• You cannot change the same digit twice in two successive moves.
forbidden. To solve the puzzle, we want to get from S to G in the fewest possible moves. A move consists
of transforming a number into another by adding or subtracting 1 to one of its digits. For example, a move
can take you from 123 to 124, or from 953 to 853. Moves are subjects to the following constraints:
• You cannot add to the digit 9 or subtract from the digit 0
• You cannot make a move that transforms the current number into one of the forbidden numbers
• You cannot change the same digit twice in two successive moves.-We are given two 3-digit numbers called S (start) and G (goal), and also a set of 3-digit numbers called
forbidden. To solve the puzzle, we want to get from S to G in the fewest possible moves. A move consists
of transforming a number into another by adding or subtracting 1 to one of its digits. For example, a move
can take you from 123 to 124, or from 953 to 853. Moves are subjects to the following constraints:
• You cannot add to the digit 9 or subtract from the digit 0
• You cannot make a move that transforms the current number into one of the forbidden numbers
• You cannot change the same digit twice in two successive moves.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Three_digit_puzzel/cal_heuristic.m
Three_digit_puzzel/check_constraints.m
Three_digit_puzzel/generate_children.m
Three_digit_puzzel/order_fringe.m
Three_digit_puzzel/puzzle.txt
Three_digit_puzzel/remove_first.m
Three_digit_puzzel/start.m
Three_digit_puzzel/check_constraints.m
Three_digit_puzzel/generate_children.m
Three_digit_puzzel/order_fringe.m
Three_digit_puzzel/puzzle.txt
Three_digit_puzzel/remove_first.m
Three_digit_puzzel/start.m
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.