โ Scribed by Kemal Oflazer
No coin nor oath required. For personal study only.
We present a connectionist approach for solving Tangram puzzles. Tangram is an ancient Chinese puzzle where the object is to decompose a given figure into seven basic geometric figures. One connectionist approach models Tangram pieces and their possible placements and orientations as connectionist neuron units which receive excitatory connections from input units defining the puzzle and lateral inhibitory connections from competing or conflicting units. The network of these connectionist units, operating as a Boltzmann Machine, relaxes into a configuration in which units defining the solution receive no inhibitory input from other units. We present results from an implementation of our model using the Rochester Connectionist Simulator.
๐ SIMILAR VOLUMES
Genetic programming (GP) can learn complex concepts by searching for the target concept through evolution of a population of candidate hypothesis programs. However, unlike some learning techniques, such as Artificial Neural Networks (ANNs), GP does not have a principled procedure for changing parts
Hopfield presented a neural network with continuous states, associated with an analogue circuit (1984). On the condition that the weights keep T, = -f\_\_a\*~ T,~, and T,j = Tj,./>0 for i 4:j, the potential u; of the neurons in the system can be of the properties like those of fluid and the communic
Edited By Margaret J. Snowling And Charles Hulme. Includes Bibliographical References And Indexes.