Part 2 - Informed Search: For the dominoes puzzle, find the maximum number of dominoes which Examples: nput: 3x3 Board (as shown in the figure below) • Position of bombs (1,3) and (2,1)

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter10: Classes And Data Abstraction
Section: Chapter Questions
Problem 23PE
icon
Related questions
Question
100%

BY USING (Prolog) & Create a GUI .

Part 2 - Informed Search:
For the dominoes puzzle, find the maximum number of dominoes which can be placed.
Examples:
Input:
3x3 Board (as shown in the figure below)
• Position of bombs (1,3) and (2,1)
Output(s):
3 is maximum number of dominoes that can be placed.
Input:
• 2x4 Board (as shown in the figure below)
• Position of bombs (2,2) and (2,3)
Transcribed Image Text:Part 2 - Informed Search: For the dominoes puzzle, find the maximum number of dominoes which can be placed. Examples: Input: 3x3 Board (as shown in the figure below) • Position of bombs (1,3) and (2,1) Output(s): 3 is maximum number of dominoes that can be placed. Input: • 2x4 Board (as shown in the figure below) • Position of bombs (2,2) and (2,3)
Output(s):
3 is maximum number of dominoes that can be placed.
Problem Components:
This program consists of the following engine:
Planner Engine (responsible for the following)
o Taking the query entered by the user in Prolog.
o Applying the planning algorithm using one of the uninformed search algorithms in
part 1 and an informed search algorithm in part 2 to get the path. (Search
algorithms should be implemented using an open list and a closed list)
Transcribed Image Text:Output(s): 3 is maximum number of dominoes that can be placed. Problem Components: This program consists of the following engine: Planner Engine (responsible for the following) o Taking the query entered by the user in Prolog. o Applying the planning algorithm using one of the uninformed search algorithms in part 1 and an informed search algorithm in part 2 to get the path. (Search algorithms should be implemented using an open list and a closed list)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Eight puzzle problem
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning