Tuning Chess Evaluation Function Parameters Using Differential Evolution Algorithm (Report) Tuning Chess Evaluation Function Parameters Using Differential Evolution Algorithm (Report)

Tuning Chess Evaluation Function Parameters Using Differential Evolution Algorithm (Report‪)‬

Informatica 2011, June, 35, 2

    • $5.99
    • $5.99

Publisher Description

Thesis Summary This article is an extended abstract of a doctoral dissertation on chess evaluation function tuning with differential evolution (DE) algorithm. DE is adopted for efficient chess evaluation function tuning, extended with an opposition-based optimization and a new history mechanism. Experimental results show that the algorithm is efficient and can be applied to the chess evaluation function tuning that has more or less knowledge.

GENRE
Business & Personal Finance
RELEASED
2011
June 1
LANGUAGE
EN
English
LENGTH
4
Pages
PUBLISHER
Slovenian Society Informatika
SELLER
The Gale Group, Inc., a Delaware corporation and an affiliate of Cengage Learning, Inc.
SIZE
61.6
KB
Achieving Consensus in Robot Swarms Achieving Consensus in Robot Swarms
2010
Issues and Challenges in Artificial Intelligence Issues and Challenges in Artificial Intelligence
2011
Recent Advances in Computational Optimization Recent Advances in Computational Optimization
2010
Automating the Design of Data Mining Algorithms Automating the Design of Data Mining Algorithms
2009
Agent-Based Evolutionary Search Agent-Based Evolutionary Search
2010
Evolutionary Scheduling Evolutionary Scheduling
2009
A Performance Evaluation of Distributed Algorithms on Shared Memory and Message Passing Middleware Platforms (Javaspaces, CORBA) A Performance Evaluation of Distributed Algorithms on Shared Memory and Message Passing Middleware Platforms (Javaspaces, CORBA)
2005
Theory of K-Representations As a Comprehensive Formal Framework for Developing a Multilingual Semantic Web (Report) Theory of K-Representations As a Comprehensive Formal Framework for Developing a Multilingual Semantic Web (Report)
2010
On the Crossing Number of Almost Planar Graphs. On the Crossing Number of Almost Planar Graphs.
2006
Named Entity Recognition Using Appropriate Unlabeled Data, Post-Processing and Voting (Technical Report) Named Entity Recognition Using Appropriate Unlabeled Data, Post-Processing and Voting (Technical Report)
2010
Efficient Morphological Parsing with a Weighted Finite State Transducer (Report) Efficient Morphological Parsing with a Weighted Finite State Transducer (Report)
2009
The Modelling of Manpower by Markov Chains--a Case Study of the Slovenian Armed Forces (Report) The Modelling of Manpower by Markov Chains--a Case Study of the Slovenian Armed Forces (Report)
2008