Scribd
Upload
41 views1 page

AI Problem Formulation Assignment

This document outlines three assignments for a search problem formulation and solution class. The first assignment asks students to model an automated timetable generation system using a genetic algorithm. The second assignment requires specifying initial states, goal tests, operators, and path costs for coloring a map and getting a monkey to bananas. The third assignment involves formulating the problem of constructing crossword puzzles as a search problem and choosing a search strategy to solve it.

Uploaded by

Syếđ AbữBâkar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views1 page

AI Problem Formulation Assignment

This document outlines three assignments for a search problem formulation and solution class. The first assignment asks students to model an automated timetable generation system using a genetic algorithm. The second assignment requires specifying initial states, goal tests, operators, and path costs for coloring a map and getting a monkey to bananas. The third assignment involves formulating the problem of constructing crossword puzzles as a search problem and choosing a search strategy to solve it.

Uploaded by

Syếđ AbữBâkar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Department of Computer Science

COMSATS Institute of Information Technology Islamabad

Assignment 1: Search Problem Formulation and Solution

Total Marks: 30
Deadline: 7 March 2016 (before 2 PM)
Class: BSSE VI(B)
1. Problem 1: Consider you want to implement an automated time table
generation system for COMSATS Institute of Information Technology
Islamabad. You have to present a model for solving this problem using
Genetics Algorithm. Specifically, you have to give a state description,
how offsprings are generated? What fitness function can be used? and
what is candidate selection criteria, etc. You have to show working of
your system through performing one or two iterations.
2. Give initial state, goal test, operators and path cost for each of the
following. There are several possible formulations for each problem
with varying levels of detail. The main thing is that your formulations
should be precise and hang together so that they could be
implemented:
a. You have to color a planar map using four colors, with no adjacent
regions to have same color.
b. A monkey is in a room with crate, with bananas suspended just out of
reach on the ceiling. He would like to get the bananas.
3. Consider the problem of constructing crossword puzzles: fitting words
into a grid of intersecting horizontal and vertical squares. Assume that
a list of words (i.e., a dictionary) is provided, and that the task is to fill
in the squares using any subset of this list. Go through a complete goal
and problem formulation for this domain, and choose a search strategy
to solve it. Specify the heuristic function, if you think one is needed.

You might also like