New directions in enumerative chess problems

Normally a chess problem must have a unique solution, and is deemed unsound even if there are alternatives that differ only in the order in which the same moves are played. In an enumerative chess problem, the set of moves in the solution is (usually) unique but the order is not, and the task is to count the feasible permutations via an isomorphic problem in enumerative combinatorics. Almost all enumerative chess problems have been ``series-movers'', in which one side plays an uninterrupted series of moves, unanswered except possibly for one move by the opponent at the end. This can be convenient for setting up enumeration problems, but we show that other problem genres also lend themselves to composing enumerative problems. Some of the resulting enumerations cannot be shown (or have not yet been shown) in series-movers. This article is based on a presentation given at the banquet in honor of Richard Stanley's 60th birthday, and is dedicated to Stanley on this occasion.Comment: 14 pages, including many chess diagrams created with the Tutelaers font

Classifier System Learning of Good Database Schema

This thesis presents an implementation of a learning classifier system which learns good database schema. The system is implemented in Java using the NetBeans development environment, which provides a good control for the GUI components. The system contains four components: a user interface, a rule and message system, an apportionment of credit system, and genetic algorithms. The input of the system is a set of simple database schemas and the objective for the classifier system is to keep the good database schemas which are represented by classifiers. The learning classifier system is given some basic knowledge about database concepts or rules. The result showed that the system could decrease the bad schemas and keep the good ones

Classifier System Learning of Good Database Schema

This thesis presents an implementation of a learning classifier system which learns good database schema. The system is implemented in Java using the NetBeans development environment, which provides a good control for the GUI components. The system contains four components: a user interface, a rule and message system, an apportionment of credit system, and genetic algorithms. The input of the system is a set of simple database schemas and the objective for the classifier system is to keep the good database schemas which are represented by classifiers. The learning classifier system is given some basic knowledge about database concepts or rules. The result showed that the system could decrease the bad schemas and keep the good ones

Algorithmic music composition: a survey

This paper surveys some of the methods used for algorithmic composition and their evolution during the last decades. Algorithmic composition was motivated by the natural need to assist and to develop the process of music creation. Techniques and applications of algorithmic composition are broad spectrum, ranging from methods that produce entire works with no human intervention, up to methods were both composer and computer work closely together in real-time. Common algorithms used for music composition are based in stochastic, deterministic, chaotic and artificial intelligence methods.N/