This simulates a basic dungeon escape with creature encounters.You must create a simple program that allows the Player to move their character across a map and find theexit. There will be one BOSS monster trying to catch the player. When the player makes a move (step) themonster must make 1 step (preferably toward the player).The player must always start off at location row 0 column 0. The destination is at location row 18 and column19. The monster starts at row18 column 10. This is summarized in the table below.Player starting locationExit (Player destination)BOSS monster starting location04318Please enter a direction w,a,5,6 of Fita odt:18Column019The most basic Al strategy for the monster must be implemented as follows:The monster makes a move in a random direction each time the player makes a move. Not that the monster mustactually move a step.If you implement the Al using a recursive solution to track the player, bonus marks will be applied.10The file map1.txt contains the map for the level. The map file is organized as follows:The first line contains two integers and c representing the number of rows and columns in the map.The next r lines of the file contain c space separated integers which are either D or 1.A "1" represents a wall and a "0" means no wall.An example of the file and how it would be rendered by your program is shown below with the Player (p) andMonster (m) overlaid. You must also implement these additional features and information:1) As the player moves, there is a 25 percent (25%) chance of a small creature attacking (not the BOSS)The creature's information is as follows:Name: KoboldHP: 70Damage: 202) The player starts with:HP: 400Damage: 353) BOSS monster information:Name: BlightDragonHP:600Damage:50If the player meets a creature or the BOSS, a fight ensues as follows:The battle continues until the player or the opponent (BOSS or creature) has HP of 0 or less.The battle broken up into rounds (similar to our previous labs)At the start of each round:1) A random roll out of 100 is done:If the roll is 50 -100, the player attacks first (player is the attacker, the opponent is the defender)If the roll is 1 - 49, the opponent attacks first (opponent is the attacker, the player is the defender)2) The attacker makes a random roll out of 100.a. If the roll if 50-100, the attacker hits and does their full damage to the defenderb. If the roll is 1-49, the attacker misses3) If the defender is still alive, the defender makes a random roll out of 100.a. If the roll if 50-100, the defender hits and does their full damage to the attackerb. If the roll is 1-49, the defender missesThese steps are repeated until the battle ends.The game ends when either:The player has reached the exit• The player is defeated (HP<=0)

Here is your required code:#include<stdio.h> #include<bits/stdc++.h> using namespace…

This simulates a basic dungeon escape with creature encounters. You must create a simple program that allows the player to move their character across a map and find the exit. There will be one BOSS monster trying to catch the player. When the player makes a move (step) the monster must make 1 step (preferably toward the player). The player must always start off at location row 0 column 0. The destination is at location row 18 and column 19. The monster starts at row18 column 10. This is summarized in the table below.

This simulates a basic dungeon escape with creature encounters. You must create a simple program that allows the player to move their character across a map and find the exit. There will be one BOSS monster trying to catch the player. When the player makes a move (step) the monster must make 1 step (preferably toward the player). The player must always start off at location row 0 column 0. The destination is at location row 18 and column 19. The monster starts at row18 column 10. This is summarized in the table below.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Start myNum RANDOM(1,10) false true myNum > 8 DISPLAY("Done") DISPLAY(myNum) 身

microsoft visual studio
A Costume shop requests a Computer application that advertizes Costume rentals. This week's Costume rental specials are as follows : Table Costume Price per week Renaissance Fair $40 Stormtrooper $49 Batman / Batgirl $36 Pirate $29 Write an application that allows the user to select any of the five costume rental specials. When the user selects a costume, the corresponding cost and a picture of the costume should be displayed. Clear each prior price and picture when the user selects a different costume. After selecting a costume, the user should be able to book the costume rental. Complete on Visual Basics Attach Screenshot
A number maze is an n × n grid of positive integers. A token starts in the upper left corner; your goal is to move the token to the lower-right corner. On each turn, you are allowed to move the token up, down, left, or right; the distance you may move the token is determined by the number on its current square. For example, if the token is on a square labeled 3, then you may move the token three steps up, three steps down, three steps left, or three steps right. However, you are never allowed to move the token off the edge of the board. 6 3574 5 315 3 283 35 74 6 53 15 1 4 2 8 3 1 4 4 5 7 2 3 4 5 7 2 3 3 1 3 2★ 3 KT3 A 5 × 5 maze that can be solved in eight moves In this problem, you will design and analyze an efficient algorithm that either returns the minimum number of moves required to solve a given number maze, or correctly reports that the maze has no solution. Describe the solution to this problem at a high level, justify why it works, write down the pseudocode for your algorithm…
Javafx Programming Using Scenebuilder with eclipse or another ide code this in JAVA code this program 02 - Rational GUI: Using the Rational class code from Lab 4, create a GUI which allows you to add, subtract, multiply, and divide Rational numbers by entering the numerator and denominator in separate fields. The results should also be displayed in two separate fields.
Add Fractions problem: create in a sandbox environment. Directions: In this program you will ask the user for 4 integers that represtent two fractions. First ask for the numerator of the first and then the denominator. Then ask for the numerator and denominator of the second. Your program should add the two fractions and print out the result. For example: a sample program run might look like this, Numerator One: 1 Denominator One: 2 Numerator Two: 2 Denominator Two: 5 The sum is 9/10 //remember if you have two fractions, the following formula should be used: a/b + c/d = (a*d +b*c) / b* d public class MyProgram { public static void main(String[] args) { //Ask the user for 4 numbers. (don't forget to import your Scanner class) //create your final numerator //create your final denominator //print out your result like the example above
10- height=3 row = 0 whilerow< height+1: count = 0 whilecount<height - row: print(end=" ") count += 1 count = 0 whilecount< row+1: print(end="*") count += 1 print() row += 1 What is theresult? A) B) C) D) * **** * **** ** *** ** *** *** ** *** ** **** * **** *
Change the order of the numbered Use Case Definition steps to correspond to the following problem definition: A college provides every incoming freshman with a gift card for a choice of two specialty restaurants within the cafeteria. Students should select one specialty restaurant they want. A program opens a window that displays each specialty restaurant one picture at a time when a student clicks the corresponding button. After making a decision, the student should click the Select Restaurant button. After selecting a restaurant, the student should exit the application.
A pizza menu allows you to select 4 toppings at no extra charge from a list of 9 possible toppings. The number of ways can you select 4 toppings pizza will be Select one: O 84 O 126 O 36 O 256
PROGRAMMING LANGUAGE: C++ALSO PASTE SCREENSHOTS OF OUTPUTS You are required to create a simulation of an elevator system. There are 7 floors in a building. A user may enter the elevator and press the button of the destined floor. The simulation should display appropriate messages while moving towards the destined floor.
Computer Science Part C: Interactive Driver Program Write an interactive driver program that creates a Course object (you can decide the name and roster/waitlist sizes). Then, use a loop to interactively allow the user to add students, drop students, or view the course. Display the result (success/failure) of each add/drop.
You are hired by a game design company and one of their most popular games is The Journey. The game has a ton of quests, and for a player to win, the player must finish all the quests. There are a total of N quests in the game. Here is how the game works: the player can arbitrarily pick one of the N quests to start from. Once the player completes a quest, they unlock some other quests. The player can then choose one of the unlocked quests and complete it, and so on. For instance, let’s say that this game had only 4 quests: A, B, C, and D. Let’s say that after you complete • quest A, you unlock quests [B, D]. • quest B, you unlock quests [C, D]. • quest C, you unlock nothing [ ]. • quest D, you unlock quest [C]. Is this game winnable? Yes, because of the following scenario: The player picks quest A to start with. At the end of the quest A, the unlocked list contains [B, D]. Say that player chooses to do quest B, then the…