WSP 2: Mix-up ink: Strategy 2Start with three sorted bottles. In the strategy the idea is to loadthree bottles with uniform colour and then move ink around for anumber of moves until the bottles are mixed up.Advantage: Result is always solvable since the bottles arecreated in a reversed-gamestrategy.Disadvantage: It is hard to develop an algorithm which will reachthe bottoms of the bottles. We tried this by moving on itemfrom every bottle in rounds. But it still took more than 100moves to obtain a good mix in the bottles. WSP 2: Implement any strategy• You need to extend your WaterSort program to implement oneof these strategies. It is a good idea to play around with both –please use Random numbers in both cases.Important: To add ink to a bottle (strategy 1) or to move ink fromone bottle to another (strategy 2) or you need to use the stackoperators.• You need to ensure that you are not spilling ink! (now youunderstand why you needed the getSize()) method in Part 1.• You only need to submit one of the two strategies. Your programshould have output of 5 scrambled bottles.

import java.util.Scanner; class MyArrayList<E> { private int size; // Number of elements in…

WSP 2: Mix-up ink: Strategy 2 Start with three sorted bottles. In the strategy the idea is to load three bottles with uniform colour and then move ink around for a number of moves until the bottles are mixed up. Advantage: Result is always solvable since the bottles are created in a reversed-game strategy. Disadvantage: It is hard to develop an algorithm which will reach the bottoms of the bottles. We tried this by moving on item 100

WSP 2: Mix-up ink: Strategy 2 Start with three sorted bottles. In the strategy the idea is to load three bottles with uniform colour and then move ink around for a number of moves until the bottles are mixed up. Advantage: Result is always solvable since the bottles are created in a reversed-game strategy. Disadvantage: It is hard to develop an algorithm which will reach the bottoms of the bottles. We tried this by moving on item 100

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

Related questions

Q: Reimplement the TrafficLight class using a simple counter that is advanced in each call to next. If…

A: According to the Question below the Solution: Output:

Q: %Dice Game Simulation while r round_total/2 || P2Wins (r) > round_total/2 % Player 1 or Player 2…

A: You can use a while loop to keep rolling the dice until the appropriate number is rolled in your…

Q: Two hunters have set off to get food from the forest. They have two possible games that they can…

A: The correct answer for the above mentioned question is given in the following steps for your…

Q: Build a two-player Tic-Tac-Toe game, and use a loop to keep the game running until a player wins or…

A: Inside initialisze_board method :Create a matrix of size 3 * 3 and return itInside the print_board…

Q: A boatman, a wolf, a sheep, and a cabbage are on the bank of a river. They have a small boat that is…

A: Given:

Q: Can you provide the code and comment for this question.

A: Let's delve into the code and the concepts involved in more detail.Understanding the Problem:The…

Q: Write a Tic Tac Toe game played by only AI and only with random picks. Detect tie or win. Write a…

A: To create a Tic Tac Toe game played by only AI, you can implement an AI algorithm to play against…

Q: Since creating and destroying a game object are both computationally expensive operations, we can…

A: In this question we have to understand what would happen if we had to fee few or too many game…

Q: A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a…

A: Since programming language is not mentioned I have used C++ programming language. The number of…

Q: Write a short choose-your-own-adenture game. The first page should start with, "I was walking on…

A: Algorithm for Choose-Your-Own-Adventure Game1. Display the initial page with a message "I was…

Q: Need help in writing a backtracking code that finds a path in a given maze. The problem is that the…

A: Code: #include<stdio.h> // Maze size#define N 4 bool solveMazeUtil(int maze[N][N], int x, int…

Q: Bresenham’s line (JAVA) method such that you can scale the line before drawing it. Normally, you…

A: Java is an object-oriented programming language. It is platform-independent. Bresenham's Line…

Q: Use java. Random rand = new Random(), for loop, for nested loop Run 5 simulations of 10 districts…

A: The java program is given below:

Concept explainers

Topological Sort

Topological sort is a sorting technique that sets up a hierarchy in a process. In this technique, when a directed network has nodes connected by arrows, the root node is placed before the successor node.

Question

WSP 2: Mix-up ink: Strategy 2
Start with three sorted bottles. In the strategy the idea is to load
three bottles with uniform colour and then move ink around for a
number of moves until the bottles are mixed up.
Advantage: Result is always solvable since the bottles are
created in a reversed-game
strategy.
Disadvantage: It is hard to develop an algorithm which will reach
the bottoms of the bottles. We tried this by moving on item
from every bottle in rounds. But it still took more than 100
moves to obtain a good mix in the bottles.

WSP 2: Implement any strategy
• You need to extend your WaterSort program to implement one
of these strategies. It is a good idea to play around with both –
please use Random numbers in both cases.
Important: To add ink to a bottle (strategy 1) or to move ink from
one bottle to another (strategy 2) or you need to use the stack
operators.
• You need to ensure that you are not spilling ink! (now you
understand why you needed the getSize()) method in Part 1.
• You only need to submit one of the two strategies. Your program
should have output of 5 scrambled bottles.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Update Bresenham's line (JAVA) method such that you can scale the line before drawing it. Normally, you pass two points and a Graphics' object to draw line using Bresenham's algorithm. Now you'll add scaling factors in arguments for scaling as shown below. public void drawBresenhamline(Point p1, Point p2, double Sx, double Sy, Graphics g) { I/write your code here } Note:If you use scaling method, then also write Scale method in solution.
Implement turn() method for MadlyRotatingBuccaneer: (inherited class of player which has turncount field (int)) When turning, the player’s direction changes to the next Direction (or to the first one if the current one is the last). public enum Direction { UP, RIGHT, DOWN, LEFT } The MadlyRotatingBuccaneer is a bit different: it considers how many times he has come to play already, and turns that much. So, when he plays for the first time, he doesn’t change his direction at all. The next time he’s playing, he turns just once, like a regular Player. Then he turns back a full 180°. And so on…
● Simulate the game (this will require using while and if statements as we learned in class) by using the round and trial counters you have established. ● Store a win for Player 1 or Player 2 after each round (indicate a win by a 1 and a loss by a 0). ● Store the cumulative wins of each player after each round (“P1Wins_Talley” and “P2Wins_Talley”). ● Store the overall game results in a matrix called “store_results”. Column 1 lists the round number , Column 2 lists the total number of trials in that round , Column 3 records which player won that round (1 or 2) , Column 4 records the value of Dice 1 , Column 5 records the value of Dice 2 , Column 6 records the sum of the two dice at the end of that round (which should equal the value in Column 1) I am creating a game where two players try to roll two die that equal the current round. For example, if the round is 3, the players must roll a 2 and a 1. I have written this code so far, but I am not getting the end result I need. I was hoping…
Please help me create a cave class for a Hunt the Wumpus game. You can read the rules in it's entirety of the Hunt the Wumpus game online to get a better idea of the specifications. It's an actual game. INFORMATION: The object of this game is to find and kill the Wumpus within a minimum number of moves, before you get exhausted or run out of arrows. There is only one way to win: you must discover which room the Wumpus is hiding in and kill it by shooting an arrow into that room from an adjacent room. The Cave The Wumpus lives in a cave of 30 rooms. The rooms are hexagonal. Each room has up to 3 tunnels, allowing access to 1, 2 or 3 (out of 6) adjacent rooms. The attached diagram shows the layout of rooms in the cave. The map wraps around such that rooms on the edges (white cells) have neighbors from the opposite edge (blue cells). E.g., the neighbors of room 1 are rooms 25, 26, 2, 7, 6, and 30, and you could choose to connect room 1 to any of these rooms. Observe how room 1…
tep: A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3steps at a time. Implement a method to count how many possible ways the child can run up thestairs.
Can you please give me a code that runs properly this time Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example, for the following board,X X X XX O O XX X O XX O X XAfter capturing all regions, the board becomesX X X XX X X XX X X XX O X XThe algorithm should take an input file, named “input.txt”, and output the resulting board in the console.Sample input.txt6X X X X X OX O X O O XX X O O O XX X X O X XX O X X O OX X X X X XThe first line is a number indicating the size of the board; in the above example, 6 means the board is .Output for in console:X X X X X OX X X X X XX X X X X XX X X X X XX X X X O OX X X X X X