All categories

2 years ago

Consider the problem of solving two 8-puzzles.

Computers and Technology

1 answer:

Law Incorporation [45]2 years ago

3 0

Answer:

See Explaination

Explanation:

d. If both players play perfectly, then too each player will play not let the other win. Let there be a state of the game in which the goal state can be achieved in just 2 more moves. If player 1 makes one move then the next move made player 1 will win or player 2 do the same.

Either way whatever the rule states, there must be a winner emerging.

Check attachment for option a to c.

You might be interested in

How will you swap pictures between a Publication page and the scratch area

tamaranim1 [39]

Answer:

To move a picture from your publication to the scratch area, click and drag a picture off of a publication page. Then drop it into the scratch area in Publisher.

hope it helped you..

4 0

1 year ago

A videogame designer would be most interested in the _____ elements of beowulf.

adelina 88 [10]

I think he would be interested in a. epic elements of beowulf.

5 0

2 years ago

Read 2 more answers

1. image-editing software

Snezhnost [94]

PDF:-Portable Document Format
Database software:-software that organizes a collection of information
image-editing software :-software used to enhance photographs
presentation software :-software used to create a slide show
CAD:-software used to create technical drawings.

Done

8 0

1 year ago

What is peopleware?<br>need help

Oksana_A [137]

Answer:

Peopleware is a term used to refer to one of the three core aspects of computer technology, the other two being hardware and software.

3 0

2 years ago

Write a Python function prime_generator that takes as argument positive integers s and e (where s

nika2105 [10]

Answer:

def prime_generator(s, e):

for number in range(s, e+1):

if number > 1:

for i in range(2, number):

if (number % i) == 0:

break

else:

print(number)

prime_generator(6,17)

Explanation:

I believe you want to ask the prime numbers between s and e.

- Initialize a for loop that iterates from s to e

- Check if the number is greater than 1. If it is, go inside another for loop that iterates from 2 to that number. If the module of that number to any number in range (from 2 to that number) is equal to 0, this means the number is not a prime number. If the module is not equal to zero, then it is a prime number. Print the number

6 0

3 years ago