首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
COMP3411代做、代写C/ C++语言程序
项目预算:
开发周期:
发布时间:
要求地区:
2024/3/13 00:41 COMP3411/9814 Project 1
COMP3411/9814 Artificial
Intelligence
Term 1, 2024
Assignment 1 – Bridge Puzzle
Due: Friday 15 March, 10pm
Marks: 12% of final assessment
Specification
This project is based on a popular puzzle, variously known
as "Hashiwokakero"
,
"Hashi" or "Bridges". You will need to
write a program to solve this puzzle, and provide a brief
description of the algorithm and data structures you have
used. The input to your program will be a rectangular array
of numbers and dots, for example:
.1...6...7....4.4.2.
..4.2..2...3.8...6.2
.....2..............
5.c.7..a.a..5.6..8.5
.............2......
...5...9.a..8.b.8.4.
4.5................3
2024/3/13 00:41 COMP3411/9814 Project 1
https://www.cse.unsw.edu.au/~cs3411/24T1/hw1/index.html 2/8
....2..4..1.5...2...
.2.7.4...7.2..5...3.
............4..3.1.2
Each number represents an "island"
, while the dots
represent the empty space (water) between the islands.
Numbers larger than 9 are indicated by 'a' (10), 'b' (11)
or 'c' (12). The aim is to connect all the islands with a
network of bridges, satisfying these rules:
1. all bridges must run horizontally or vertically
2. bridges are not allowed to cross each other, or other
islands
3. there can be no more than three bridges connecting any
pair of islands
4. the total number of bridges connected to each island
must be equal to the number on the island
For example, after reading the 10-line input above, your
program might produce this output:
1---6EEE7====4=4=2
4-2" 2 " 3E8EEE6 2
# |2 " " " # "
5EcE7EEaEa==5"6EE8=5
" # " # #2# |
" #5===9Ea--8=bE8E4|
4=5# " # " # " |3
2024/3/13 00:41 COMP3411/9814 Project 1
https://www.cse.unsw.edu.au/~cs3411/24T1/hw1/index.html 3/8
#2==4 #1-5 # 2 |"
2=7=4===7=2" 5===3"
4==3-1 2
Note that single bridges are indicated by the characters '-
' or '|', pairs of bridges by '=' or '"' and triples by 'E'
or '#', depending on whether they run horizontally or
vertically. Water between bridges and islands is indicated by
space characters ' '.
In some cases, there may be many solutions, in which case
your program should only print one solution. More details
about the puzzle can be found on this Wikipedia page. Note,
however, that our version allows up to 3 bridges instead of
2; also, we do not insist that the entire graph be connected.
Tools
An executable file called bridgen is provided in the
tools directory which can be used to generate sample
data of any specified size (type bridgen -help for
details). Another executable called bridgecheck is also
provided, to help you test the validity of your solutions (see
FAQ for details).
Questions
2024/3/13 00:41 COMP3411/9814 Project 1
https://www.cse.unsw.edu.au/~cs3411/24T1/hw1/index.html 4/8
At the top of your code, in a block of comments, you must
provide a brief answer (one or two paragraphs) to this
Question:
Briefly describe how your program works, including any
algorithms and data structures employed, and explain
any design decisions you made along the way.
Language Options
You are free to write the code in a language of your
choosing.
If you write in C, C++, or another compiled languge, your
program will be invoked by: ./hashi
You should submit your source files (no object files) as
well as a Makefile which, when invoked with the
command make , will produce an executable called
hashi
If you write in Python, your program will be invoked by:
./hashi.py
You should submit your .py files (including
hashi.py ).
The first line of your code must specify which version of
Python you are using, e.g. #!/usr/bin/python3
If you write in Java, your program will be invoked by:
java Hashi
You should submit your .java files (no .class
2024/3/13 00:41 COMP3411/9814 Project 1
https://www.cse.unsw.edu.au/~cs3411/24T1/hw1/index.html 5/8
files).
The main file must be called Hashi.java
If you wish to write in some language not covered by the
above options, let us know and we will try to
accommodate you.
Regardless of the language, you are not allowed to use
dedicated constraint programming packages like
python-constraint , etc. You are expected to
implement the search method(s) yourself.
Submission
You should submit by typing
give cs3411 hashi ...
Remember to include all necessary files in your submission
(including the one with the answer to the Question).
You can submit as many times as you like – later
submissions will overwrite earlier ones. You can check that
your submission has been received by using the following
command:
3411 classrun -check
The submission deadline is Friday 15 March, 10 pm.
5% penalty will be applied to the mark for every 24 hours
late after the deadline, up to a maximum of 5 days (in
accordance with UNSW policy).
2024/3/13 00:41 COMP3411/9814 Project 1
https://www.cse.unsw.edu.au/~cs3411/24T1/hw1/index.html 6/8
Additional information may be found in the FAQ and will be
considered as part of the specification for the project.
Questions relating to the project can also be posted to the
Forums on WebCMS.
If you have a question that has not already been answered
on the FAQ or the Forums, you can email it to
cs3411@cse.unsw.edu.au
Assessment
Your program will be tested on a series of sample inputs of
successively increasing size and difficulty. There will be:
6 marks for functionality (automarking)
4 marks for your algorithm and implementation
2 marks for answer to the Question
You should always adhere to good coding practices and
style. In general, a program that attempts a substantial part
of the job but does that part correctly will receive more
marks than one attempting to do the entire job but with
many errors.
Groups
This assignment may be done individually, or in groups of
two students. Groups are determined by an SMS field called
pair1 . Every student has initially been assigned a unique
2024/3/13 00:41 COMP3411/9814 Project 1
https://www.cse.unsw.edu.au/~cs3411/24T1/hw1/index.html 7/8
pair1 which is "h" followed by their student ID
number, e.g. h1234567 .
1. If you plan to complete the assignment individually, you
don't need to do anything (but, if you do create a group
with only you as a member, that's ok too).
2. If you wish to team up with someone, you should go to
the WebCMS page and click on "Groups" in the left
hand column, then click "Create". Click on the menu for
"Group Type" and select "pair". After creating a group,
click "Edit"
, search for the other member, and click
"Add". WebCMS assigns a unique group ID to each
group, in the form of "g" followed by six digits (e.g.
g012345 ). We will periodically run a script to load
these values into SMS.
Plagiarism Policy
Your program must be entirely your own work. In addition,
soliciting another person (or an AI bot) to write code for you
– either in person or through the Internet – is never
permitted. Generally, the copying of code already available
on the Internet is also forbidden. If you find some piece of
"standard" code in a textbook, or on the Internet, which you
would like to adapt and incorporate into your own
assignment, you must email the lecturer in charge to ask if it
is permissible to do so in the particular circumstances – in
2024/3/13 00:41 COMP3411/9814 Project 1
https://www.cse.unsw.edu.au/~cs3411/24T1/hw1/index.html 8/8
which case the source would have to be acknowledged in
your submission, and you would need to demonstrate that
you had done a substantial amount of work for the
assignment yourself. Plagiarism detection software will be
used to compare all submissions pairwise and serious
penalties will be applied, particularly in the case of repeat
offences.
DO NOT COPY FROM OTHERS; DO NOT ALLOW
ANYONE TO SEE YOUR CODE
Please refer to the UNSW Policy on Academic Integrity and
Plagiarism if you require further clarification on this matter.
Good luck!
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
data程序代写、代做c/c++编程语...
2024-05-17
data程序代写、代做python编程...
2024-05-17
program代做、c/c++,python程...
2024-05-17
代写math 3333 3.0 - winter 2...
2024-05-17
代做seng6110 programming ass...
2024-05-17
代写seng6110 object oriented...
2024-05-17
代写comp828: statistical pro...
2024-05-17
代做culture and society调试数...
2024-05-17
代做comp 4911 winter 2024 as...
2024-05-17
代做lh physical iiib / 03 33...
2024-05-17
代做3032ict big data analyti...
2024-05-17
代写comp4702 report代写留学生...
2024-05-17
代写fin2020 hw6代写c/c++编程
2024-05-17
热点标签
fit2004
fit3152
mec208
econ20120
cpt304
econ2101
econ0051
engi4547
econ1048
eengm2510
fit1008
7033mkt
ec2066
cct380h5f
man00019m
mech265001
fin2020
fit9137
n1542
csc4140
math6119
comp1710
fina864
csys5020
busi4412
math5007
2702ict
dts204tc
comp2003j
cosc2673
ecmt2150
bff3121–
comu7000
stat6118
comp814
acc202
ematm0067
bit233
ecs776p
600543
bpln0025
comp3400
econ7030
159.342 ‐ operating
mang6134
math1005/math6005
geog5404m
comp1710/6780
infs 2042
inf6028
bman30702
math0002
msci242l
mgt11001
com00177m
bman71282
fit2001
cpt210
159.341
econ7310
comp3221
comp10002
cpt206
ecmt1010
finm081
econ2005
cpt202
fit3094
socs0030
data7201
data2x01
mn-3507
mat246h1
ib2d90
ib3j80
acc207
comp90007
compx518-24a
fit1050
info1111
acct2201
buad801
compsci369
cse 332s
info1110
math1033
scie1000
eeee2057
math4063
cmt219
econ5074
eng5009
csse2310/csse7231
ec333
econ0001
cpt204
elec4630
ma117
dts104tc
comp2017
640481
csit128
eco000109m
finc5090
ggr202h5f
nbs8295
4ssmn902
chc6171
dsa1002
ebu6304
comp1021
csci-ua.202
com6511
ma416
mec206
iom209
bism7202
idepg001
cpt106
comp1212
ecom209
math1062
mn-3526
fnce3000
fmhu5002
psyc10003
fina2222
be631-6-sp/1
finc2011
37989
5aaob204
citx1401
econ0028
bsan3204
comp9123
cmt218
itp122
qbus6820
ecmt1020
bus0117
soft3202/comp9202
basc0057
mecm30013
aem4060
acb1120
comp2123
econ2151
ecmt6006
inmr77
com 5140
ocmp5328
comp1039
had7002h
cmt309
asb-3715
elec373
cpt204-2324
be631-6-sp
econ3016
mast10007
buss6002
comp4403
comp30023
finm1416
csc-30002
6qqmn971
fin668
mnfg309
inft2031
cits1402
comp2011
eecs 3221
ebu4201
ct60a9600
com336
8pro102
econ7300
comp3425
comp8410
comp222
finm8007
comp2006
comp26020
comp1721
eeen3007j
cis432
csci251
comp5125m
com398sust
finm7405
econ7021
fin600
infs4205/7205
mktg2510-
32022
mth6158
comp328
finn41615
2024
mec302
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!