Efficient utilization of time and effort is essential in Personnel scheduling problems to evenly balance the workload among the people and attempt to satisfy the personnel preferences. In Constraint Satisfaction Problem based scheduling problems, when a branch of the search fails the backtracking search algorithm back up to the preceding variable and try a different value for it. So here the mo...

In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism of ACO’s to simultaneously search for tours starting from all positions on the chessboard. We compare the new algorithm to a recently reported genetic algorithm, and to a depth-first backtracking search using Warnsdorff...

An efficient backtracking algorithm makes with a large dictionary and the heuristic of selecting possible a very fast program to play the SCRABBLE” Brand the move with the highest score at each turn makes a Crossword Game. The efficiency is achieved by creating data very fast program that is rarely beaten by humans. The structures before the backtracking search begins that serve program makes n...

Many applications|from planning and scheduling to problems in molecular biology| rely heavily on a temporal reasoning component. In this paper, we discuss the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's innuential interval-based framework for representing temporal information. At the core of the system are algorithms for determining whether the t...

We propose a new backtracking algorithm called constraint-directed backtracking (CDBT) for solving general constraint-satisfaction problems (CSPs). CDBT and the naive backtracking (BT) share a similar style of instantiating and re-instantiating variables. They diier in that CDBT searches for an assignment to variables in a variable set from the given constraint posed on that variable set and ap...

Many applications|from planning and scheduling to problems in molecular biology|rely heavily on a temporal reasoning component. In this paper, we discuss the design and an empirical analysis of algorithms for a temporal reasoning system based on Allen's innuential interval-based framework for representing temporal information. At the core of the system are algorithms for determining whether the...