## Backward Chaining implementation as State Space Search problem

To me, Backward Chaining implementation can be viewed as a state space search problem. In this problem, a state consists two components: (Path, Goals) Path is the list of ordered rules that are used. Goals is the set of facts that currently need to be deduced. An available action at a state is a applicable [...]

## Knowledge Representation Project

I had this project done (the code part) in roughly 10 days. I do not think that I should upload the source code on here because it can be my final project and may help me graduate from university, LOL. My project is a mix of Computational Networks and Fuzzy Knowledge Based System (my teacher [...]

## [Prolog] Missionaries and Cannibals – M Missionaries & C Cannibals & Boat carries N passengers version

In the missionaries and cannibals problem, three missionaries and three cannibals must cross a river using a boat which can carry at most two people, under the constraint that, for both banks, if there are missionaries present on the bank, they cannot be outnumbered by cannibals (if they were, the cannibals would eat the missionaries). [...]

## [Prolog] Tower of Hanoi – M discs & N poles version

The Tower of Hanoi (also called the Tower of Brahma or Lucas’ Tower, and sometimes pluralized) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of [...]

## [Prolog] State space search method

This is not an introductory article into state space search method in general. Rather, it will show you how to implement state space search method in Prolog. Backtracking is in the nature of Prolog’s interpreter so the idea here is: We will utilize its backtracking nature to implement depth-first search. If you are not sure [...]

## [Prolog] The Three Jealous Men and Their Wives

Three men, travelling with their wives, came to a river which they wanted to cross. The one available boat would accomodate only two people. Since the husbands were very jealous, no woman could be with a man unless her own husband was present. Under these severe handicaps, how can they get across the river using [...]

## LISP homeworks

Concatenate list1 and list2. [crayon-5b752d43b8809076915552/] Add one element to the tail of the list. [crayon-5b752d43b8814066714439/] Delete list’s last element. [crayon-5b752d43b8819581908378/] Delete list’s head element. [crayon-5b752d43b881d426478611/] L1 – L2. Return list with elements that are in L1 but not in L2. [crayon-5b752d43b8822512761223/] L1 intersect L2. Return list with elements that are in both L1 and L2. [crayon-5b752d43b8826380045172/] Summation [...]

## Prefix expression evaluation in Prolog

A friend of mine this morning asked me to program Prolog to evaluate [+, +, /, 1, 2, *, 5, 6, 7] and return X as the output with X’s value equals 1 / 2 + 5 * 6 + 7. I do not know her motivation behind this question still I find it interesting so I have [...]

## Minimum Cut – UI Part

Finally I have the UI part of Minimum Cut project done. Only the UI part, no more. I know the UI part is not good nor bad. It is so-so, enough for me and my friend to express our algorithm, enough to almost push me into some heart-attack. Maybe I will improve it at some [...]

## [Borland Graphics Interface] Paint

This is the first post of my site. I have deadlines beforehead and I am almost dead now. And I am here to share the souce code of a very-not-good-but-worked project that I have to develop when I took a Computer Graphics in my university. I do not think this is a good reference overall (due [...]