99爱在线视频这里只有精品_窝窝午夜看片成人精品_日韩精品久久久毛片一区二区_亚洲一区二区久久

合肥生活安徽新聞合肥交通合肥房產(chǎn)生活服務(wù)合肥教育合肥招聘合肥旅游文化藝術(shù)合肥美食合肥地圖合肥社保合肥醫(yī)院企業(yè)服務(wù)合肥法律

CSCI1540代做、代寫C++設(shè)計(jì)編程

時(shí)間:2023-12-12  來源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯(cuò)



CSCI1540 Fundamental Computing Using C++, Fall 2023/24
Department of Computer Science and Engineering, The Chinese University of Hong Kong
Copyright © 2023 CSE, CUHK Page 1 of 7
Assignment 6: Rush Hour
Due: 23:59, Sat 9 Dec 2023 File names: RushHour.cpp
playgame.cpp
Full marks: 100
Introduction
The objective of this assignment is to practice object-oriented programming. You will write a class
and a client program to play a sliding block puzzle game called Rush Houra
.
The game is played on a grid of size 8 × 8 with at most 10 cars on it. The cars are aligned either
vertically or horizontally in the grid and occupy two or three tiles. There is an exit hole on the right
side of the grid. The goal of the puzzle is to move the cars forward or backward (but not change
direction) so that a designated car (called Car 0) moves to the exit hole. Figure 1(a) shows an
example puzzle configuration, in which Cars 0, 1, 6, and 7 are horizontal and can move left or right,
and Cars 2, 3, 4, and 5 are vertical and can move up or down. Moving Car 1 to the right by one tile
yields the state in Figure 1(b). Continuing to move the cars carefully, you can yield the solved state as
in Figure 1(c) where Car 0 reaches the exit hole on the right.
########
#11...2#
#3..4.2#
#3004.2.
#3..4..#
#5...66#
#5.777.#
########

########
#.11..2#
#3..4.2#
#3004.2.
#3..4..#
#5...66#
#5.777.#
########
→ … →
########
#311...#
#3.....#
#3....00
#5..4.2#
#5664.2#
#7774.2#
########
(a) Initial (b) Move Car 1 (c) Solved
Figure 1: An Example Rush Hour Configuration and its Solved State
Program Specification
You shall write your program in two source files RushHour.cpp and playgame.cpp. The former is
the implementation of the class RushHour, while the latter is a client program of class RushHour
which performs the program flow. You are recommended to finish the RushHour class first before
writing the client program. When you write the RushHour class, implement the member functions
and test them individually one by one. Your two files will be graded separately, so you should not mix
the functionalities of the two files.
Class RushHour (RushHour.cpp)
You are given the interface of the RushHour class in the header file RushHour.h. You shall not
modify the contents of this header file. Descriptions of the class are given below.
a You may play Rush Hour online at: https://www.mahjongfun.com/rush-hour/
CSCI1540 Fundamental Computing Using C++, Fall 2023/24
Department of Computer Science and Engineering, The Chinese University of Hong Kong
Copyright © 2023 CSE, CUHK Page 2 of 7
class RushHour {
public:
 RushHour(const string g[]);
 bool locateCar(int car, int &row, int &col);
 int moveCar(int car, int step);
 bool isSolved();
 int getTotalSteps();
 void print();
private:
 string grid[8];
 int totalSteps;
};
Private Data Members
string grid[8];
The Rush Hour puzzle is represented by an array of string. Each element grid[𝑖] stores the
contents in row 𝑖 of the grid. E.g., for the configuration in Figure 1(a), grid[0] is “########”,
grid[1] is “#11...2#”, grid[2] is “#3..4.2#”, etc. All characters in the strings are either ‘#’
(border), ‘.’ (empty), or digits ‘0’–‘9’ (cars). All the strings are of length 8.
int totalSteps;
The total number of steps that a player has moved during puzzle play. Note that moving a car by, say,
two tiles, is counted as two steps.
Public Constructor and Member Functions
RushHour(const string g[]);
This constructor initializes the Rush Hour puzzle using the array parameter g, which contains
contents for row 1 to row 6 of the grid. (That is, g[0] is used to initialize grid[1]; g[1] is used to
initialize grid[2]; …; g[5] is used to initialize grid[6].) Note that row 0 and row 7 are not
needed in the parameter because the two rows always contain only the ‘#’ symbol. You just have to
initialize grid[0] and grid[7] as “########”. E.g., suppose g is {"#11...2#", "#3..4.2#",
"#3004.2.", "#3..4..#", "#5...66#", "#5.777.#"}. Then grid shall be initialized such
that grid[0]…grid[7] become “########”, “#11...2#”, “#3..4.2#”, “#3004.2.”,
“#3..4..#”, “#5...66#”, “#5.777.#”, and “########” respectively (that is, the configuration in
Figure 1(a)).
You can assume that:
➢ Array parameter g is always of size 6;
➢ Each string g[0], …, g[5] is always of length 8, and always contains eight symbols of either ‘#’
(border), ‘.’ (empty), or digits ‘0’–‘9’ (cars);
➢ The strings g[0], …, g[5] always start and end with the border ‘#’. An exception is on g[2] (for
grid[3]), where its last character is always the exit hole (‘.’).
➢ The cars always occupy either two or three tiles, and are always properly aligned vertically or
horizontally.
CSCI1540 Fundamental Computing Using C++, Fall 2023/24
Department of Computer Science and Engineering, The Chinese University of Hong Kong
Copyright © 2023 CSE, CUHK Page 3 of 7
You do not have to handle situations where the parameter g does not conform to these assumptions.
Remember to also initialize the data member totalSteps as 0.
bool locateCar(int car, int &row, int &col);
Finds the position of the parameter car in the puzzle. The position of a vertical car is its topmost tile.
The position of a horizontal car is its leftmost tile. The row and column indices of the found position
are assigned to the reference parameters row and col respectively, and the member function shall
return true. E.g., locating Car 2 in Figure 1(a) shall write 1 to row and 6 to col and return true,
because Car 2 appears at row 1, column 6. In case car cannot be located in the grid (e.g., there is no
Car 8 in Figure 1(a)), the member function shall not update row and col and return false.
int moveCar(int car, int step);
Performs the action of moving the parameter car by step tiles. A positive value for step means
moving down (for vertical car) or right (for horizontal car); a negative value means moving up (for
vertical car) or left (for horizontal car). E.g., in Figure 1(a), moving Car 6 left by three tiles has a step
of -3. A move is valid only if all the followings are satisfied:
➢ The parameter car exists in the grid.
➢ The parameter step is non-zero. (Moving a car by 0 tile is meaningless.)
➢ There is enough space to allow the car to move by step tiles, without hitting other cars or the
border, or going beyond the exit hole. (E.g., in Figure 1(a), Car 6 cannot move left by four tiles (-4
steps), as it would hit Car 5.)
If the move is valid, then data members grid and totalSteps shall be updated accordingly.
Otherwise, no updates to grid and totalSteps are needed. This member function shall return
either 0, 1, or 2, according to the following conditions:
Condition Return value
Move is valid 0
car does not exist in the grid or step is zero 1
Hit other cars or border or go beyond the exit hole 2
Implementation hint: First, find the position of car (with the help of locateCar()). Then
determine which one of the four cases the prospective move is: move left/right/up/down. Implement
the four cases one by one. For each case, check whether the move is valid or not. If valid, update the
car to the new position (by updating the grid contents).
bool isSolved();
Returns true if Car 0 touches the exit hole; returns false otherwise.
int getTotalSteps();
Returns the total number of steps that a player has moved the cars. That is, the value of the data
member totalSteps.
void print();
Prints out the Rush Hour puzzle and the number of steps that the player has used. The following is
an example output of print().
CSCI1540 Fundamental Computing Using C++, Fall 2023/24
Department of Computer Science and Engineering, The Chinese University of Hong Kong
Copyright © 2023 CSE, CUHK Page 4 of 7
########
#311..2#
#3....2#
#300..2.
#5..4..#
#5664..#
#7774..#
########
Steps: 10
Client Program (playgame.cpp)
Your main program is a client of the RushHour class. You create a RushHour object here and call its
member functions to implement the following program flow.
1. The program starts with prompting the user to enter six strings (separated by spaces), which are
the initial grid contents for row 1 to row 6 of the puzzle. Then create a RushHour object using
the user input. You can assume that the six strings follow the same assumptions stated in the
constructor above).
2. Prompt the user to move a car. You can assume that the user always enters two integers,
denoting the car and the steps of the prospective move respectively. (Positive step means
moving down/right; negative step means moving up/left.)
3. In case the input is not a valid move (see definition in the moveCar() member function above),
the program prints a warning message and goes back to Step 2. Otherwise, move the car
accordingly.
Note: there are two kinds of warning messages. When the car does not exist or the step is zero,
the message “Invalid car or step! Try again.” shall be printed. When the move would hit other
cars or border or go beyond the exit hole, the message “Hit! Try again.” shall be printed.
4. If the puzzle is not yet solved after the move and the total number of steps is smaller than 100,
go back to Step 2.
5. Finally, print the puzzle and either the winning message “Congrats! You finished in 𝑋 steps.”
(where 𝑋 is the number of steps used) or the losing message “Oops! You could not solve in 100
steps.”
Some Points to Note
➢ You cannot declare any global variables in all your source files (except const ones).
➢ Remember to #include "RushHour.h" in both RushHour.cpp and playgame.cpp.
➢ You can write extra functions in any source files if necessary. However, extra member functions
(instance methods), no matter private or public, are not allowed.
➢ Your RushHour class shall not contain any cin statements. All user inputs shall be done in the
client program (playgame.cpp) only.
➢ The RushHour class shall not contain any cout statements except in the print() member
function for printing the puzzle.
CSCI1540 Fundamental Computing Using C++, Fall 2023/24
Department of Computer Science and Engineering, The Chinese University of Hong Kong
Copyright © 2023 CSE, CUHK Page 5 of 7
Sample Run
In the following sample run, the blue text is user input and the other text is the program output. You
can try the provided sample program for other input. Your program output should be exactly the
same as the sample program (same text, symbols, letter case, spacings, etc.). Note that there is a
space after the ‘:’ in the program printout. More sample runs and initial grids are available in
Blackboard.
Enter initial grid: #11...2# #3..4.2# #3004.2. #3..4..# #5...66# #5.777.#
########
#11...2#
#3..4.2#
#3004.2.
#3..4..#
#5...66#
#5.777.#
########
Steps: 0
Move a car: 1 4
Hit! Try again.
Move a car: 1 1
########
#.11..2#
#3..4.2#
#3004.2.
#3..4..#
#5...66#
#5.777.#
########
Steps: 1
Move a car: 3 0
Invalid car or step! Try again.
Move a car: 3 -2
Hit! Try again.
Move a car: 8 1
Invalid car or step! Try again.
Move a car: 3 -1
########
#311..2#
#3..4.2#
#3004.2.
#...4..#
#5...66#
#5.777.#
########
Steps: 2
Move a car: 5 -1
CSCI1540 Fundamental Computing Using C++, Fall 2023/24
Department of Computer Science and Engineering, The Chinese University of Hong Kong
Copyright © 2023 CSE, CUHK Page 6 of 7
########
#311..2#
#3..4.2#
#3004.2.
#5..4..#
#5...66#
#..777.#
########
Steps: 3
Move a car: 7 -2
########
#311..2#
#3..4.2#
#3004.2.
#5..4..#
#5...66#
#777...#
########
Steps: 5
Move a car: 6 -3
########
#311..2#
#3..4.2#
#3004.2.
#5..4..#
#566...#
#777...#
########
Steps: 8
Move a car: 4 2
########
#311..2#
#3....2#
#300..2.
#5..4..#
#5664..#
#7774..#
########
Steps: 10
Move a car: 2 3
########
#311...#
#3.....#
#300....
#5..4.2#
#5664.2#
#7774.2#
########
Steps: 13
Move a car: 0 5
Hit! Try again.
Move a car: 0 4
CSCI1540 Fundamental Computing Using C++, Fall 2023/24
Department of Computer Science and Engineering, The Chinese University of Hong Kong
Copyright © 2023 CSE, CUHK Page 7 of 7
########
#311...#
#3.....#
#3....00
#5..4.2#
#5664.2#
#7774.2#
########
Steps: 17
Congrats! You finished in 17 steps.
Submission and Marking
➢ Your program file names should be RushHour.cpp and playgame.cpp. Submit the two files in
Blackboard (https://blackboard.cuhk.edu.hk/). You do not have to submit RushHour.h.
➢ Insert your name, student ID, and e-mail as comments at the beginning of all your files.
➢ Besides the above information, your program should include suitable comments as
documentation in all your files.
➢ You can submit your assignment multiple times. Only the latest submission counts.
➢ Your program should be free of compilation errors and warnings.
➢ Do NOT share your work to others and do NOT plagiarize. Those who shared their work and/or
plagiarized others work shall be penalized.
請(qǐng)加QQ:99515681 或郵箱:99515681@qq.com   WX:codehelp

掃一掃在手機(jī)打開當(dāng)前頁
  • 上一篇:代寫CS 8編程、代做Python語言程序
  • 下一篇:COMP2396代做、代寫Tic-Tac-Toe Game設(shè)計(jì)編程
  • 無相關(guān)信息
    合肥生活資訊

    合肥圖文信息
    急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計(jì)優(yōu)化
    急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計(jì)優(yōu)化
    出評(píng) 開團(tuán)工具
    出評(píng) 開團(tuán)工具
    挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
    挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
    海信羅馬假日洗衣機(jī)亮相AWE  復(fù)古美學(xué)與現(xiàn)代科技完美結(jié)合
    海信羅馬假日洗衣機(jī)亮相AWE 復(fù)古美學(xué)與現(xiàn)代
    合肥機(jī)場(chǎng)巴士4號(hào)線
    合肥機(jī)場(chǎng)巴士4號(hào)線
    合肥機(jī)場(chǎng)巴士3號(hào)線
    合肥機(jī)場(chǎng)巴士3號(hào)線
    合肥機(jī)場(chǎng)巴士2號(hào)線
    合肥機(jī)場(chǎng)巴士2號(hào)線
    合肥機(jī)場(chǎng)巴士1號(hào)線
    合肥機(jī)場(chǎng)巴士1號(hào)線
  • 短信驗(yàn)證碼 豆包 幣安下載 AI生圖 目錄網(wǎng)

    關(guān)于我們 | 打賞支持 | 廣告服務(wù) | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責(zé)聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網(wǎng) 版權(quán)所有
    ICP備06013414號(hào)-3 公安備 42010502001045

    99爱在线视频这里只有精品_窝窝午夜看片成人精品_日韩精品久久久毛片一区二区_亚洲一区二区久久

          9000px;">

                日韩欧美成人一区二区| 狠狠色综合日日| 在线精品视频一区二区| 亚洲三级在线看| 欧美精品一区二区在线观看| 欧美精品亚洲二区| 日本韩国欧美三级| 色综合一区二区三区| 成人h动漫精品一区二| 韩国女主播成人在线| 国产在线精品不卡| 国产在线精品一区二区夜色| 韩国欧美国产1区| 国产电影一区在线| 成人精品免费视频| 91麻豆高清视频| 欧洲精品视频在线观看| 91成人免费在线视频| 欧美日韩高清一区二区不卡| 欧美一级欧美一级在线播放| 久久久无码精品亚洲日韩按摩| 91精品在线麻豆| 日韩伦理免费电影| 久久久久久久久久久久久久久99| 精品国产一区二区亚洲人成毛片| 精品福利一区二区三区| 中文字幕中文在线不卡住| 一区二区三区在线观看视频| 亚洲国产精品久久人人爱| 五月婷婷色综合| 精品亚洲成a人| 国产激情一区二区三区| 日本福利一区二区| 欧美一区二区精美| 国产精品乱人伦一区二区| 亚洲黄色小视频| 麻豆国产精品视频| 成人国产亚洲欧美成人综合网| 色综合久久久久网| 欧美一区二区视频在线观看| 2020国产精品久久精品美国| 日韩网站在线看片你懂的| 欧美激情资源网| 亚洲日本在线天堂| 美女免费视频一区二区| 美洲天堂一区二卡三卡四卡视频| 久久精品国产网站| 日本韩国欧美国产| 日韩一区二区三区av| 91伊人久久大香线蕉| 日韩欧美激情一区| 国产视频视频一区| 亚洲成av人**亚洲成av**| 久久精品国产**网站演员| 国产露脸91国语对白| 欧美日韩国产三级| 久久亚洲精华国产精华液 | 精品国精品自拍自在线| 国产欧美日韩视频一区二区| 亚洲欧美日韩人成在线播放| 三级成人在线视频| 日本韩国一区二区| 日韩欧美一区在线| 国产精品福利一区二区| 久久国产精品色| 色综合久久中文字幕综合网| 欧美日韩国产电影| 337p粉嫩大胆噜噜噜噜噜91av| 中文字幕欧美一| 国产一区二区在线观看视频| 在线观看亚洲精品| 欧美日韩免费电影| 国产日韩三级在线| 日日骚欧美日韩| 欧美视频自拍偷拍| 国产精品视频看| 亚洲美女视频一区| 99久久精品国产麻豆演员表| 欧美日韩亚洲丝袜制服| 又紧又大又爽精品一区二区| 精品一区二区三区视频在线观看 | 成人av综合一区| 久久婷婷国产综合国色天香| 午夜久久电影网| 欧美日本视频在线| 一区二区三区国产精华| 粉嫩aⅴ一区二区三区四区| 久久精品视频网| 蜜臀av性久久久久蜜臀aⅴ| 欧美一区二区三区的| 亚洲韩国一区二区三区| 波多野结衣精品在线| 亚洲色图欧洲色图婷婷| 成人看片黄a免费看在线| 日本午夜精品一区二区三区电影| 69久久99精品久久久久婷婷 | 欧美国产一区在线| 久久精品国产99国产精品| 久久久久久亚洲综合影院红桃| 日韩极品在线观看| 成人av手机在线观看| 一区二区三区91| 99re热这里只有精品视频| 亚洲图片欧美一区| 欧美视频一区二区| 亚洲国产精品高清| 欧美在线观看视频在线| 亚洲精品日韩一| 在线观看日韩国产| 亚洲第四色夜色| 8v天堂国产在线一区二区| 亚洲r级在线视频| 精品久久久久久久久久久久包黑料| 日本特黄久久久高潮| 久久精品欧美一区二区三区不卡 | 日精品一区二区| 欧美大黄免费观看| 奇米精品一区二区三区在线观看一| 国产在线国偷精品免费看| 久久精品亚洲麻豆av一区二区 | 精品亚洲国产成人av制服丝袜| 日韩欧美你懂的| 成人午夜精品在线| 国产精品国产a| 亚洲国产精品黑人久久久| 精品对白一区国产伦| 99久久久无码国产精品| 午夜精品福利一区二区蜜股av| 国产一区二区导航在线播放| 三级不卡在线观看| 国产精品久久久久久户外露出| 欧美三级视频在线| 国产成人精品一区二| 一区二区三区四区中文字幕| 日韩一区二区三区电影在线观看| 一区二区在线免费| 欧美日韩国产一区二区三区地区| 亚洲视频狠狠干| 亚洲午夜一区二区| 极品尤物av久久免费看| www.亚洲色图| 日韩女优av电影| 亚洲午夜精品在线| 99久久精品情趣| 国产精品视频在线看| 久久国产福利国产秒拍| 在线免费观看成人短视频| 中文字幕欧美日韩一区| 亚洲综合男人的天堂| 成人av在线观| 久久男人中文字幕资源站| 日韩电影在线观看电影| 欧美人伦禁忌dvd放荡欲情| 国产一区二区在线观看免费| 中文乱码免费一区二区| 欧美视频自拍偷拍| 色综合网站在线| 日精品一区二区三区| 亚洲三级电影网站| 久久精品一区四区| 日韩免费成人网| 亚洲精品一区二区三区影院| 成人精品鲁一区一区二区| 国产精品18久久久久久久网站| 亚洲精品免费电影| 亚洲人亚洲人成电影网站色| 亚洲精品一线二线三线| 久久久久久一二三区| 成人午夜激情在线| 夫妻av一区二区| 亚洲成av人片观看| 丝袜亚洲另类丝袜在线| 国产寡妇亲子伦一区二区| 久久精品噜噜噜成人av农村| 久久aⅴ国产欧美74aaa| 日韩成人dvd| 美女视频黄久久| 日韩电影在线一区二区三区| 天天综合网天天综合色| 亚洲欧美视频在线观看| 亚洲图片欧美一区| 亚洲成人自拍一区| 黑人巨大精品欧美一区| 麻豆国产欧美日韩综合精品二区| 在线播放中文一区| 91精品一区二区三区久久久久久| 在线视频国内一区二区| 91视视频在线观看入口直接观看www | 不卡的av在线| 偷偷要91色婷婷| 国产精品久久久久aaaa樱花 | 日韩精品综合一本久道在线视频| 91色乱码一区二区三区| 六月婷婷色综合| 国产女人18水真多18精品一级做| 成人一区二区在线观看| 99免费精品在线观看| 国产一区二区三区| 99riav一区二区三区| 国产欧美一区二区三区鸳鸯浴 |