Corning Community College
CSCS2330 Discrete Structures
Implement a puzzle game that uses doubly-linked queues and during gameplay applies the use of bitwise or set logic to progress or succeed in the game.
This is part 2 of 3. You do not have to finish the game this week, instead, aim to complete the second third, submitting your current snapshot. More functionality than last week, but doesn’t need to be finished at this point.
Implement program in Vircon32 C, that:
You will want to go here to edit and fill in the various sections of the document:
The game criteria is intentionally very open-ended. The goal is to make a game that incorporates logic into a fun challenge. Thus far, many students are opting to adapt a game that already exists, but one could design a game from scratch if they so desired.
Game ideas one could make are Dr.Mario where the colors are logic gates and you have to modify the pills so that when a certain number are together they disappear.
One could also make the hit Commodore 64 game Number Builder but instead of numbers it is bits. Where each “tile” color is a different logical operation that affects your current number until you can get to the target number.
One could also make a tower defense game where you place towers that relate to each kind of logic and that shoot a certain number to an “enemy” number that then changes that enemy's “value.” And you keep shooting at that enemy until they become a certain number, probably zero would be the easiest.
One could also do a shooting game where you and the enemies have bullets and you shoot their bullets with different logic to turn their bullets into zero's so that they can't hurt you.
One could do a rhythm game where you have to press the right key (logic) for the right note (some number) to make it zero.
One could do a timed-based game where you are given one set of bits and need to enter another set of bits based on the bitwise operation given to you to achieve a target result of bits. If the player fails to complete a certain amount within a time frame they lose.
For refresher, there are seven logic operations one will want to make use of. This includes:
AND OR XOR
NOT
NAND NOR XNOR
A B | Y ----|-- 0 0 | 0 1 0 | 0 0 1 | 0 1 1 | 1
A B | Y ----|-- 0 0 | 0 1 0 | 1 0 1 | 1 1 1 | 1
A B | Y ----|-- 0 0 | 0 1 0 | 1 0 1 | 1 1 1 | 0
A | Y --|-- 0 | 1 1 | 0
A B | Y ----|-- 0 0 | 1 1 0 | 1 0 1 | 1 1 1 | 0
A B | Y ----|-- 0 0 | 1 1 0 | 0 0 1 | 0 1 1 | 0
A B | Y ----|-- 0 0 | 1 1 0 | 0 0 1 | 0 1 1 | 1
To be successful in this project, the following criteria (or their equivalent) must be met:
Let's say you have completed work on the project, and are ready to submit, you would do the following:
lab46:~/src/SEMESTER/DESIG/PROJECT$ submit DESIG PROJECT file1 file2 file3 ... fileN
You should get some sort of confirmation indicating successful submission if all went according to plan. If not, check for typos and or locational mismatches.
I'll be evaluating the project based on the following criteria:
572:mag1:final tally of results (572/572) *:mag1:code, XML, build script, and cartridge submitted [104/104] *:mag1:implements and functionally utilizes doubly linked queues [104/104] *:mag1:some aspect of progress captured on our way toward mag2 [104/104] *:mag1:screenshots, video produced showing aspects of game runtime [104/104] *:mag1:screenshots, video posted to discord channel [104/104] *:mag1:committed to lab46 semester repo [52/52]