INT2067 Introduction to Programming and Problem Solving


Assignment 1
INT2067 Introduction to Programming and Problem Solving
2024-2025 Semester 1
Due Date: October 30, 2024 (Wednesday)
1 Introduction
In this assignment, you need to implement a text-based game based on the riddle about
a farmer who needs to cross a river with a fox, a goose, and a sack of corn.
2 Riddle
A farmer with a fox, a goose, and a sack of corn needs to cross a river. The farmer has a
rowboat, but there is room for only the farmer and one of her three items.
Unfortunately, both the fox and the goose are hungry. The fox cannot be left alone with
the goose, or the fox will eat the goose. Likewise, the goose cannot be left alone with
the sack of corn, or the goose will eat the corn. How does the farmer get everything
across the river?
3 Game
In your text-based game, the farmer can move at most one item to the other shore each
time. You should ask the user to enter a command to determine what item the farmer
wants to take at each turn. The game ends when the user quits the game or when the
user has succeeded or failed.
4 Basic Design
You may follow the following basic flow in your program:
Show item locations.
Repeat:
1. Ask for the next command.
2. Update item locations if necessary.
3. Show item locations.
4. Exit the loop if the game has succeeded or failed.
You may need to add other steps and/or flows to fulfill all the requirements.
5 Requirements (70%)
Your program should do the following:
[5%] Print the goal of the game at the start.
[10%] Ask the user to enter a command at each turn and continue until the user
requests to quit or the goal has succeeded or failed.
[10%] Show the location of the boat and the three items (fox, goose, corn) clearly
at the start of the game and after each turn. You may follow the output in the
sample session.
Accept the following five one-character strings as valid commands: f, g, c, m or
q. After receiving a valid command, the game should:
o f, g or c: move the fox, goose, or corn, if available, to the opposite shore
along with the boat. [10%]
o m: move the boat to the opposite shore without any item. [5%]
o q: quit the game. [5%]
[10%] Check whether the requested item is on the same shore as the boat when
the game receives the command f, g or c. If not, it should prompt an error and
allow the user to enter a command again.
[10%] Check whether the game has succeeded or failed after each turn. The
game has succeeded if all items have been moved to the far shore. The game
has failed if the fox has eaten the goose, or the goose has eaten the corn. When
the game has succeeded, it should congratulate the user. When the game has
failed, it should tell the user why.
[5%] Show an error if the user has entered an unrecognized command character
(i.e. a string other than ‘f’, ‘g’, ‘c’, ‘m’ or ‘q’).
6 Program Design and User Interface (30%)
[10%] You should break down your program into functions with reasonable
length.
[10%] You should use functions and/or lists to reduce redundancy.
[10%] The output should be neat, and the required information should be shown
clearly. The text in the output should be correct and contain no spelling
mistakes.
7 Submission Requirements
Your Python file should be named as assignment1.py. Submit only the Python
file assignment1.py through Moodle. Failure to submit the file properly will
result in a penalty of 5 to 20 marks.
See Moodle for the exact time of the deadline for submission. Late submission is
usually not accepted. You should submit earlier to avoid possibly high tra ic
around the deadline.
8 Hints
Please check the discussions forum on Moodle regularly for any hints.
9 Plagiarism Policy
The assignment should be done only by yourself. Every line of code should be written by
you. Discussions on the assignment should be kept at a high-level only. You are
suggested to refer your classmates to the relevant notes or lab exercises if you want to
help them.
If cheating is found, both the copier and originator will get zero mark for the
assignment.
Repeat o enders may result in a deduction of the course grade.
If you have discussed the assignment with anyone, you should provide an
acknowledgment at the end of your program file. Give the names of all classmates that
you have discussed with. For example, your acknowledgement may look like this at the
end of your program file:
# Acknowledgement: I have discussed it with Thomas, Gordon, and Emily.
10 Sample Session 1
Welcome.
You must bring the fox, the goose, and the corn across the
 

基于遗传算法的新的异构分布式系统任务调度算法研究(Matlab代码实现)内容概要:本文档围绕基于遗传算法的异构分布式系统任务调度算法展开研究,重点介绍了一种结合遗传算法的新颖优化方法,并通过Matlab代码实现验证其在复杂调度问题中的有效性。文中还涵盖了多种智能优化算法在生产调度、经济调度、车间调度、无人机路径规划、微电网优化等领域的应用案例,展示了从理论建模到仿真实现的完整流程。此外,文档系统梳理了智能优化、机器学习、路径规划、电力系统管理等多个科研方向的技术体系与实际应用场景,强调“借力”工具与创新思维在科研中的重要性。; 适合人群:具备一定Matlab编程基础,从事智能优化、自动化、电力系统、控制工程等相关领域研究的研究生及科研人员,尤其适合正在开展调度优化、路径规划或算法改进类课题的研究者; 使用场景及目标:①学习遗传算法及其他智能优化算法(如粒子群、蜣螂优化、NSGA等)在任务调度中的设计与实现;②掌握Matlab/Simulink在科研仿真中的综合应用;③获取多领域(如微电网、无人机、车间调度)的算法复现与创新思路; 阅读建议:建议按目录顺序系统浏览,重点关注算法原理与代码实现的对应关系,结合提供的网盘资源下载完整代码进行调试与复现,同时注重从已有案例中提炼可迁移的科研方法与创新路径。
【微电网】【创新点】基于非支配排序的蜣螂优化算法NSDBO求解微电网多目标优化调度研究(Matlab代码实现)内容概要:本文提出了一种基于非支配排序的蜣螂优化算法(NSDBO),用于求解微电网多目标优化调度问题。该方法结合非支配排序机制,提升了传统蜣螂优化算法在处理多目标问题时的收敛性和分布性,有效解决了微电网调度中经济成本、碳排放、能源利用率等多个相互冲突目标的优化难题。研究构建了包含风、光、储能等多种分布式能源的微电网模型,并通过Matlab代码实现算法仿真,验证了NSDBO在寻找帕累托最优解集方面的优越性能,相较于其他多目标优化算法表现出更强的搜索能力和稳定性。; 适合人群:具备一定电力系统或优化算法基础,从事新能源、微电网、智能优化等相关领域研究的研究生、科研人员及工程技术人员。; 使用场景及目标:①应用于微电网能量管理系统的多目标优化调度设计;②作为新型智能优化算法的研究与改进基础,用于解决复杂的多目标工程优化问题;③帮助理解非支配排序机制在进化算法中的集成方法及其在实际系统中的仿真实现。; 阅读建议:建议读者结合Matlab代码深入理解算法实现细节,重点关注非支配排序、拥挤度计算和蜣螂行为模拟的结合方式,并可通过替换目标函数或系统参数进行扩展实验,以掌握算法的适应性与调参技巧。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值