积木问题 [英] The Blocks Problem

查看:52
本文介绍了积木问题的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

障碍问题:这是一个非常老的问题,但是我需要解决方案,请某人帮助我................... thx in adv ....

如果您不了解Google中的任何问题声明,而您会发现很多问题



背景



在此问题中,您将在某些规则和约束下为简单的积木世界建模.您无需确定如何达到指定状态,而是可以对机器人手臂进行``编程''以响应有限的命令集.

THE BLOCK PROBLEM: this is very old problem but i need it solution plz someone help me...........................thx in adv....

if u dont understand anything problem statement in google and u will find alot abt this



Background



In this problem you will model a simple block world under certain rules and constraints. Rather than determine how to achieve a specified state, you will ``program'''' a robotic arm to respond to a limited set of commands.

问题是要分析一系列命令,这些命令指示机械臂如何操作位于平板上的块.最初,表上有 n 个块(从0到 n -1编号),块 b i 相邻为所有< shapetype id ="_ x0000_t75" stroked ="f" fill ="f" path =阻止 b i +1 m @ 4 @ 5l @ 4 @ 11 @ 9 @ 11 @ 9 @ 5xe":o:preferrelative ="t" o:spt ="75" coordsize ="21600,21600" xmlns:o =#unknown">< ; stroke joinstyle ="miter"><公式/>< f eqn ="if lineDrawn pixelLineWidth 0">< f eqn ="sum @ 0 1 0">< f eqn ="sum 0 0 @ 1< f eqn ="产品@ 2 1 2>< f eqn ="产品@ 3 21600 pixelWidth>< f eqn ="产品@ 3 21600 pixelHeight< f eqn ="sum @ 0 0 1">< f eqn ="prod @ 6 1 2">< f eqn ="prod @ 7 21600 pixelWidth">< f eqn ="sum @ 8 21600 0< f eqn ="产品@ 7 21600 pixelHeight>< f eqn =" sum @ 10 21600 0</formulas/><路径o:connecttype =" rect"gradientshapeok ="t" o:extrusionok ="f" xmlns:o =#unknown"><锁定Aspectratio ="t" v:ext ="edit" xmlns:v =#unknown"> shape id ="_x0000_i1025"style =" WIDTH:7 9.5pt;高度:23.25pt"alt =" $ 0 \ leq i< n-1 $"type =" #_ x0000_t75"/>< imagedata o:href =" http://suraj.lums.edu.pk/~cs213a02/Lab%20Sessions/The%20Blocks%20Problem_files/101img1.gif "src ="file:///C:\ Users \ ST0NEY \ AppData \ Local \ Temp \ msohtmlclip1 \ 01 \ clip_image001.gif" xmlns:o =#unknown"/>如下图所示:

The problem is to parse a series of commands that instruct a robot arm in how to manipulate blocks that lie on a flat table. Initially there are n blocks on the table (numbered from 0 to n-1) with block bi adjacent to block bi+1 for all <shapetype id="_x0000_t75" stroked="f" filled="f" path="m@4@5l@4@11@9@11@9@5xe" o:preferrelative="t" o:spt="75" coordsize="21600,21600" xmlns:o="#unknown"><stroke joinstyle="miter"><formulas /><f eqn="if lineDrawn pixelLineWidth 0"><f eqn="sum @0 1 0"><f eqn="sum 0 0 @1"><f eqn="prod @2 1 2"><f eqn="prod @3 21600 pixelWidth"><f eqn="prod @3 21600 pixelHeight"><f eqn="sum @0 0 1"><f eqn="prod @6 1 2"><f eqn="prod @7 21600 pixelWidth"><f eqn="sum @8 21600 0"><f eqn="prod @7 21600 pixelHeight"><f eqn="sum @10 21600 0"></formulas /><path o:connecttype="rect" gradientshapeok="t" o:extrusionok="f" xmlns:o="#unknown"><lock aspectratio="t" v:ext="edit" xmlns:v="#unknown">shape id="_x0000_i1025" style="WIDTH: 79.5pt; HEIGHT: 23.25pt" alt="$0 \leq i < n-1$" type="#_x0000_t75" /><imagedata o:href="http://suraj.lums.edu.pk/~cs213a02/Lab%20Sessions/The%20Blocks%20Problem_files/101img1.gif" src="file:///C:\Users\ST0NEY\AppData\Local\Temp\msohtmlclip1\01\clip_image001.gif" xmlns:o="#unknown" />s shown in the diagram below:



< shape id = "_x0000_i1026" style ="WIDTH:324.75pt; HEIGHT:39pt" alt ="\ begin {figure}< br mode =" hold ="/> \ centering< br mode =" type ="#_ x0000_t75"> < imagedata o:href ="http://suraj.lums.edu.pk/~cs213a02/Lab%20Sessions/The%20Blocks%20Problem_files/101img2.gif" src ="file:///C:\ Users \ ST0NEY \ AppData \ Local \ Temp \ msohtmlclip1 \ 01 \ clip_image002.gif"xmlns:o ="#unknown"/>/shape/>


<shape id="_x0000_i1026" style="WIDTH: 324.75pt; HEIGHT: 39pt" alt="\begin{figure}<br mode=" hold=" />\centering<br mode=" type="#_x0000_t75"><imagedata o:href="http://suraj.lums.edu.pk/~cs213a02/Lab%20Sessions/The%20Blocks%20Problem_files/101img2.gif" src="file:///C:\Users\ST0NEY\AppData\Local\Temp\msohtmlclip1\01\clip_image002.gif" xmlns:o="#unknown" />/shape />



图: 积木世界



Figure: Initial Blocks World

用于操作块的机械手的有效命令是:


  • a 移动到 b

  • move a onto b

其中 a b 是块编号,将块 a 返回到堆积在块 b 上的所有块之后,这些块被堆积在块 a b 的顶部并返回其初始位置.

where a and b are block numbers, puts block a onto block b after returning any blocks that are stacked on top of blocks a and b to their initial positions.


  • a 移到 b

  • move a over b

其中 a b 是块编号,将块 a 返回到包含块 b 的堆栈的顶部,然后将堆叠在块 a 顶部的所有块返回到其初始位置.

where a and b are block numbers, puts block a onto the top of the stack containing block b, after returning any blocks that are stacked on top of block a to their initial positions.


  • a 堆到 b

  • pile a onto b

其中 a b 是块编号,移动由 a 块,以及堆叠在 a 块上方的所有块,再到 b 块上. b 块上方的所有块都将移动到发生堆放之前的初始位置.堆叠在块 a 上方的块在移动时保持其顺序.

where a and b are block numbers, moves the pile of blocks consisting of block a, and any blocks that are stacked above block a, onto block b. All blocks on top of block b are moved to their initial positions prior to the pile taking place. The blocks stacked above block a retain their order when moved.


  • b

其中 a b 是块编号,将由 a 块,以及堆积在 a 块上方的任何块,到包含块 b 的堆栈顶部.堆叠在块 a 上方的块在移动时保持其原始顺序.

where a and b are block numbers, puts the pile of blocks consisting of block a, and any blocks that are stacked above block a, onto the top of the stack containing block b. The blocks stacked above block a retain their original order when moved.


  • 退出

  • quit

终止块世界中的操作.

其中 a = b a b 在同一块堆栈中是非法命令.所有非法命令都应被忽略,并且对块的配置没有任何影响.

Any command in which a = b or in which a and b are in the same stack of blocks is an illegal command. All illegal commands should be ignored and should have no affect on the configuration of blocks.

输入在一行上以整数 n 开头,它本身代表了块世界中的块数.块的数量后跟一系列的块命令,每行一个命令.您的程序应处理所有命令,直到 退出 命令遇到.您可以假定所有命令都是上面指定的形式.不会有语法错误的命令.

The input begins with an integer n on a line by itself representing the number of blocks in the block world. The number of blocks is followed by a sequence of block commands, one command per line. Your program should process all commands until the quit command is encountered. You may assume that all commands will be of the form specified above. There will be no syntactically incorrect commands.

输出应包含块世界的最终状态.每个原始块位置都编号为 i (< shape id ="_ x0000_i1027" style ="WIDTH:57pt; HEIGHT:23.25pt" alt ="$ 0 \ leq i< n $" type =# _x0000_t75< imagedata o:href =" http://suraj.lums.edu.pk/~cs213a02/Lab%20Sessions/The%20Blocks%20Problem_files/101img4.gif"src =" file:///C :\ Users \ ST0NEY \ AppData \ Local \ Temp \ msohtmlclip1 \ 01 \ clip_image003.gif"xmlns:o ="#unknown"/>此处 n 是块数)应立即出现由冒号组成.如果上面至少有一个块,则冒号后面必须有一个空格,然后是一系列堆叠在该位置的块列表,每个块号与其他块号之间用空格隔开.不要在行上放置任何尾随空格.

The output should consist of the final state of the blocks world. Each original block position numbered i ( <shape id="_x0000_i1027" style="WIDTH: 57pt; HEIGHT: 23.25pt" alt="$0 \leq i < n$" type="#_x0000_t75"><imagedata o:href="http://suraj.lums.edu.pk/~cs213a02/Lab%20Sessions/The%20Blocks%20Problem_files/101img4.gif" src="file:///C:\Users\ST0NEY\AppData\Local\Temp\msohtmlclip1\01\clip_image003.gif" xmlns:o="#unknown" />here n is the number of blocks) should appear followed immediately by a colon. If there is at least a block on it, the colon must be followed by one space, followed by a list of blocks that appear stacked in that position with each block number separated from other block numbers by a space. Don''t put any trailing spaces on a line.

每个块位置应该有一行输出(即 n 行,其中 n 是输入第一行的整数).

There should be one line of output for each block position (i.e., n lines of output where n is the integer on the first line of input).

<span lang="EN">10


</span>
<span lang="EN">move 9 onto 1


</span>
<span lang="EN">move 8 over 1


</span>
<span lang="EN">move 7 over 1


</span>
<span lang="EN">move 6 over 1


</span>
<span lang="EN">pile 8 over 6


</span>
<span lang="EN">pile 8 over 5


</span>
<span lang="EN">move 2 over 1


</span>
<span lang="EN">move 4 over 9


</span>
<span lang="EN">quit


</span>



示例输出





Sample Output



<span lang="EN"><span> </span>0: 0


</span>
<span lang="EN"> 1: 1 9 2 4


</span>
<span lang="EN"> 2:


</span>
<span lang="EN"> 3: 3


</span>
<span lang="EN"> 4:


</span>
<span lang="EN"> 5: 5 8 7 6


</span>
<span lang="EN"> 6:


</span>
<span lang="EN"> 7:


</span>
<span lang="EN"> 8:


</span>
<span lang="EN"> 9:


</span>

推荐答案

0 \ leq i< n-1
0 \leq i < n-1


"type =" #_ x0000_t75"/>< imagedata o:href =" http://suraj.lums.edu.pk/~cs213a02/Lab%20Sessions /The%20Blocks%20Problem_files/101img1.gif"src =" file:///C:\ Users \ ST0NEY \ AppData \ Local \ Temp \ msohtmlclip1 \ 01 \ clip_image001.gif"xmlns:o ="#unknown"/> ; s如下图所示:
" type="#_x0000_t75" /><imagedata o:href="http://suraj.lums.edu.pk/~cs213a02/Lab%20Sessions/The%20Blocks%20Problem_files/101img1.gif" src="file:///C:\Users\ST0NEY\AppData\Local\Temp\msohtmlclip1\01\clip_image001.gif" xmlns:o="#unknown" />s shown in the diagram below:


< shape id = "_x0000_i1026" style ="WIDTH:324.75pt; HEIGHT:39pt" alt ="\ begin {figure}< br mode =" hold ="/> \ centering< br mode =" type ="#_ x0000_t75"> < imagedata o:href ="http://suraj.lums.edu.pk/~cs213a02/Lab%20Sessions/The%20Blocks%20Problem_files/101img2.gif" src ="file:///C:\ Users \ ST0NEY \ AppData \ Local \ Temp \ msohtmlclip1 \ 01 \ clip_image002.gif"xmlns:o ="#unknown"/>/shape/>


<shape id="_x0000_i1026" style="WIDTH: 324.75pt; HEIGHT: 39pt" alt="\begin{figure}<br mode=" hold=" />\centering<br mode=" type="#_x0000_t75"><imagedata o:href="http://suraj.lums.edu.pk/~cs213a02/Lab%20Sessions/The%20Blocks%20Problem_files/101img2.gif" src="file:///C:\Users\ST0NEY\AppData\Local\Temp\msohtmlclip1\01\clip_image002.gif" xmlns:o="#unknown" />/shape />



图: 积木世界



Figure: Initial Blocks World

用于操作块的机械手的有效命令是:


  • a 移动到 b

  • move a onto b

其中 a b 是块编号,将块 a 返回到堆积在块 b 上的所有块之后,这些块被堆积在块 a b 的顶部并返回其初始位置.

where a and b are block numbers, puts block a onto block b after returning any blocks that are stacked on top of blocks a and b to their initial positions.


  • a 移到 b

  • move a over b

其中 a b 是块编号,将块 a 返回到包含块 b 的堆栈的顶部,然后将堆叠在块 a 顶部的所有块返回到其初始位置.

where a and b are block numbers, puts block a onto the top of the stack containing block b, after returning any blocks that are stacked on top of block a to their initial positions.


  • a 堆到 b

  • pile a onto b

其中 a b 是块编号,移动由 a 块,以及堆叠在 a 块上方的所有块,再到 b 块上. b 块上方的所有块都将移动到发生堆放之前的初始位置.堆叠在块 a 上方的块在移动时保持其顺序.

where a and b are block numbers, moves the pile of blocks consisting of block a, and any blocks that are stacked above block a, onto block b. All blocks on top of block b are moved to their initial positions prior to the pile taking place. The blocks stacked above block a retain their order when moved.


  • b

其中 a b 是块编号,将由 a 块,以及堆积在 a 块上方的所有块,到包含块 b 的堆栈顶部.堆叠在块 a 上方的块在移动时保持其原始顺序.

where a and b are block numbers, puts the pile of blocks consisting of block a, and any blocks that are stacked above block a, onto the top of the stack containing block b. The blocks stacked above block a retain their original order when moved.


  • 退出

  • quit

终止块世界中的操作.

其中 a = b a b 在同一块堆栈中是非法命令.所有非法命令都应被忽略,并且对块的配置没有任何影响.

Any command in which a = b or in which a and b are in the same stack of blocks is an illegal command. All illegal commands should be ignored and should have no affect on the configuration of blocks.

输入在一行上以整数 n 开头,它本身代表了块世界中的块数.块的数量后跟一系列的块命令,每行一个命令.您的程序应处理所有命令,直到 退出 命令遇到.您可以假定所有命令都是上面指定的形式.不会有语法错误的命令.

The input begins with an integer n on a line by itself representing the number of blocks in the block world. The number of blocks is followed by a sequence of block commands, one command per line. Your program should process all commands until the quit command is encountered. You may assume that all commands will be of the form specified above. There will be no syntactically incorrect commands.

输出应包含块世界的最终状态.每个原始块的位置编号为 i (< shape id ="_ x0000_i1027" style ="WIDTH:57pt; HEIGHT:23.25pt" alt ="

The output should consist of the final state of the blocks world. Each original block position numbered i ( <shape id="_x0000_i1027" style="WIDTH: 57pt; HEIGHT: 23.25pt" alt="


0 \ leq i< n
0 \leq i < n


这篇关于积木问题的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆