Problem 1 [3 points]: The Isolation Game Heuristic Eval- uation Design a heuristic evaluation function to be used in solving the Knight Isolation game. In this game, every player has one knight on a chess board. They play in turns and move their knights to valid positions on the board. Initially, all cells on the board are valid. Then, any cell that has been previously visited by any knight becomes invalid. The first player that finds no valid position to move to looses the game.

Problem 1 [3 points]: The Isolation Game Heuristic Eval- uation Design a heuristic evaluation function to be used in solving the Knight Isolation game. In this game, every player has one knight on a chess board. They play in turns and move their knights to valid positions on the board. Initially, all cells on the board are valid. Then, any cell that has been previously visited by any knight becomes invalid. The first player that finds no valid position to move to looses the game.

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

Problem 5 (#2.1.36).Find the truth set of each of these predicates where the domain is the set of integers. a) P(x) : “x3≥1” b) Q(x) : “x2= 2” c) R(x) : “x < x2”
Maximum weight = 20The above problem is a 0/1 Knapsack problem. Here there are 7 different objects labelled from A to G. The objective of this problem is to carry the different objects in your bag in such a way such that the profit is maximized. But you have to make sure that your bag does not exceed the maximum weight i.e. the maximum weight that this bag can carry is less than or equal to 15. Remember you can carry an object exactly once. Now it is your job to use Genetic Algorithm to solve this problem. 1. Encode the problem and create an initial population of 4 different chromosomes 2. Think of an appropriate fitness function to this problem and give proper justification. 3. Use the fitness function to calculate the fitness level of all the chromosomes in your population 4. Perform natural selection and select the two fittest chromosomes 5. Use the parents from (4) and perform crossover to get 2 offspring 6. Perform mutation and check the fitness of the final offspring. Comment…
Q.3. This problem is known as the Three prisoners problem. Three prisoners, A, B and C, are in separate cells and sentenced to death. The governor has selected one of them at random to be pardoned. The warden knows which one is pardoned, but is not allowed to tell. Prisoner A begs the warden to let him know the identity of one of the others who is going to be executed. If B is to be pardoned, give me C's name. If C is to be pardoned, give me B's name. And if I'm to be pardoned, ip a coin to decide whether to name B or C. The warden tells A that B is to be executed. Then, Prisoner A secretly tells C the news. Prisoner A says that he is pleased because his probability of surviving has gone up from 1/3 to 1/2, as it is now between him and C. Prisoner C says that he is pleased because A still has a chance of 1/3 to be the pardoned one, but his chance has gone up to 2/3. Is the statement of Prisoner A correct? Is the statement of Prisoner C correct? 2
C PROGRAMMING HELP NEEDED! So, I've made progress on my script, but I'm having trouble making the next step in my assignment work properly. So far my script can: 1) Be prompted to type in coefficients of the Linear Systems and Two InitialConditions.D2y+a1Dy+a2 = 0; and 2) Find the roots of the second order nontrivial solution.D2y+a1Dy+a2 = 0 => λ 2+a1 λ +a2 = 0 But I need it to do the following: Based on the roots λ1 and λ2 of the second order system, your script should decide: a) If roots (λ’s) are nonrepeating real , the response y(t) isy(t) = C1 e λ1t+C2e λ2t, for t≥0.Find C’s and display your y(t) on screen. b) If roots (λ’s) are repeating real (λ1 =λ2), the response y(t) isy(t) = (C1 +C2te)λt, for t≥0.Find C’s and display your y(t) on screen. c) If roots (λ’s) are complex conjugate (λ’s = α+jβ and α-jβ ), the response y(t) isy(t)=Cαtcos(βt+θ), for t≥0.Find C and θ and display your y(t) on screen. Please use conditionals. Also please use user-defined functions to compute C’s…
For doing the lab activity: 1) Apply Recursive function technique to solve Problem 1 and 2. (Do not use iterative method) 2) Use map, filter, reduce and lambda functions to solve the problem 3. 1.Evaluate Binomial Coefficient. nCr=n! / (r! *(n-r)!) 2. Fibonacci Numbers (Sequence): 0, 1, 1, 2, 3, 5, 8 …
C. A min-cut network problem: The school marching band consists of students, dressed red or black, standing in an n x n grid. The music teacher wants to designate a subset of the red-dressed students such that no two red-dressed students are in the same row or column. Design and explain an algorithm that takes in a grid of red-dressed and black-dressed students and determines the size and a configuration of the largest subset of the red-dressed that can be designated.
5. Consider the heuristics for this problem shown in the table above, h1 is admissible.
2. A safe has 5 locks v, w, y and z; all of which must be unlocked for the safe to open. The keys to the locks are distributed among five executives in the following manner.Mr. A has keys for locks v and x. Mr. B has keys for locks v and y. Mr. C has keys for locks w and y. Mr. D has keys for locks x and z. Mr. E has keys for locks v and z.a) Determine the minimal number of executives required to open the safe.b) Find all the combinations of executives that can open the safe; write and expression f(A, B, C, D, E) which specifies when the safe can be opened as a function of what executives are present.c) Who is the essential executive?
Using c++ Apply both breadth-first search and best-first search to a modified version of MC problem. In the modified MC, a state can contain any number of M’s and any number of C’s on either side of the river. Assume the goal is always to move all the persons on the left side to the right side. The Initial state should be a parameter given to the program at beginning of execution. As in the original problem, boat capacity =2, the boat cannot move by itself, and on either side C’s should not outnumber M’s. For best-first search, you need to come up with an appropriate heuristic. In addition to solving the problem, your grade will also be based on th effectiveness of the heuristic. As an example, the program should execute as follows. Initial state… Enter number of M’s on left side of the river: 3 Enter number of C’s on left side of the river: 1 Enter number of M’s on right side of the river: 0 Enter number of C’s on right side of the river: 0 Enter location of the boat: L The output…
Problem 5: Disjoint sets. Consider a list of cities c1, c2, . . . , cn. Assume we have a relationR such that, for any i, j, R(ci, cj ) is 1 if cities ci and cj are in the same province, and 0otherwise.(i) Using a disjoint set data structure, write an algorithm that puts each city in a setsuch that ci and cj are in the same set if and only if they are in the same province.Justify corectness of your algorithm.(ii) If a disjoint set data structure is implemented by trees and in union the name of thenew set is always the name of the larger set, what is the worst-case running time ofyour algorithm.
Question 2 – Simple Machine-Learning Function Java Program A Learning Function is an empirical formula which isresponsible for regulating the training of an agentwith respect to Machine Learning and Artificial Intelligence (AI). In this regard, given below is ourprototype Learning Function, ?, which tunes and regulates the training as well as learning in our AIagents. This is defined such that: ? = ? ∗ ΩGiven that Ω = 0.567143 and ? is a dynamic variable, which is defined with respect to the day ofthe week and the time of the day, as illustrated in the table below: Weekday/Time Day-Light Night-Time Monday 2.53 3.25 Tuesday 3.15 2.99 Wednesday 3.00 3.99 Thursday 2.41 2.68 Friday 1.99 3.73 Saturday 3.59 2.86 Sunday 2.00 2.59 Therefore, write a Java class/program correctly such that your source code will accomplish the following: 1. Display a prompt message for the user to enter the Weekday and the Time as a single input separated via the space character. Thus, valid…
Correct answer will be upvoted else Multiple Downvoted. Computer science. Gildong has a square board comprising of n lines and n sections of square cells, each comprising of a solitary digit (from 0 to 9). The cell at the j-th section of the I-th line can be addressed as (i,j), and the length of the side of every cell is 1. Gildong prefers enormous things, so for every digit d, he needs to find a triangle with the end goal that: Every vertex of the triangle is in the focal point of a cell. The digit of each vertex of the triangle is d. Somewhere around one side of the triangle is corresponding to one of the sides of the board. You might expect that a side of length 0 is corresponding to the two sides of the board. The space of the triangle is boosted. Obviously, he can't simply be content with tracking down these triangles with no guarantees. Along these lines, for every digit d, he will change the digit of precisely one cell of the board to d, then, at that point, track…