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 US$
    • ‏5٫99 US$

وصف الناشر

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.

النوع
تمويل شركات وأفراد
تاريخ النشر
٢٠١١
١ يونيو
اللغة
EN
الإنجليزية
عدد الصفحات
٤
الناشر
Slovenian Society Informatika
البائع
The Gale Group, Inc., a Delaware corporation and an affiliate of Cengage Learning, Inc.
الحجم
٦١٫٦
ك.ب.
Achieving Consensus in Robot Swarms Achieving Consensus in Robot Swarms
٢٠١٠
Issues and Challenges in Artificial Intelligence Issues and Challenges in Artificial Intelligence
٢٠١١
Recent Advances in Computational Optimization Recent Advances in Computational Optimization
٢٠١٠
Automating the Design of Data Mining Algorithms Automating the Design of Data Mining Algorithms
٢٠٠٩
Agent-Based Evolutionary Search Agent-Based Evolutionary Search
٢٠١٠
Evolutionary Scheduling Evolutionary Scheduling
٢٠٠٩
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)
٢٠٠٥
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)
٢٠١٠
On the Crossing Number of Almost Planar Graphs. On the Crossing Number of Almost Planar Graphs.
٢٠٠٦
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)
٢٠١٠
Efficient Morphological Parsing with a Weighted Finite State Transducer (Report) Efficient Morphological Parsing with a Weighted Finite State Transducer (Report)
٢٠٠٩
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)
٢٠٠٨