Algorithms Q&A - Recent questions in CSP

Comparison of Lottery Choices and MEU

Sun, 16 Apr 2023 19:53:02 +0000

Given these two lottery choices:

A: [0.75, $3k; 0.25, $0]

B: [1.0, $2k; 0.0, $0]

and

C: [0.3, $3k; 0.7, $0]

D: [0.4, $2k; 0.6, $0]

People seem to prefer B over A, and C over D

What are the implications of this observation?

What is the contradiction here? What assumption did you use to arrive at your contradiction?

Snake - A through Y on a 5 x 5 grid

Sun, 16 Apr 2023 19:50:15 +0000

You are given a 5 x 5 grid, and this grid should hold the letters A through Y. Some of the cells in the grid are already filled out. The others can go anywhere, but the constraint is that adjacent letters (for example F and G) must be adjacent to each other, either horizontally or vertically.

- - - - Y
R A - - -
- - - - -
- E - - -
- - - - K

Design a solution for this constraint satisfaction problem. (Solution should explain the variables, the domain values, the constraints, and how the constraint propagation would work.)

Algorithm for Power Plant CSP

Wed, 24 Mar 2021 16:43:15 +0000

Design a solution for the given constraint satisfaction problem. Solution should explain the variables, the domain values, the constraints, the heuristics, and how the constraint propagation would work.

In a country, there are 15 power plants. They produce different amount of power, that is given by the array P[i]. The total power produced must equal at least X (for example 1000), but should not exceed 1500 to maintain a decent price. For adequate workforce planning and employment reasons, at least one of the power plant near each city must operate each day.

Partial example..

Power Plant, i	P[i]	Associated Cities
P1	200	C1,C2
P2	200	C2, C3
P3	180	C2, C4, C6
P4	210	C5,C6
……	…..	……….
i-th power plant	P[i]	List of cities