text:
% Encoding: UTF-8

@Online{Wiki2018,
  author   = {Chess Programming Wiki},
  title    = {Simplified Evaluation Function},
  year     = {2018},
  url      = {https://www.chessprogramming.org/Simplified_Evaluation_Function},
  urldate  = {2019-10-29},
  file     = {:Wiki2018.pdf:PDF},
  keywords = {evaluation function, simplified evaluation function},
}

@Article{Knuth1975,
  author   = {Knuth, Donald and Moore, Ronald},
  title    = {An analysis of alpha-beta pruning},
  journal  = {Artificial Intelligence},
  year     = {1975},
  volume   = {6},
  month    = {12},
  pages    = {293-326},
  file     = {:Knuth1975.pdf:PDF},
  keywords = {alpha beta pruning},
}

@Article{Shannon1950,
  author  = {Shannon, Claude},
  title   = {XXII. Programming a computer for playing chess},
  journal = {Philosophical Magazine},
  year    = {1950},
  volume  = {41},
  month   = {03},
  pages   = {256-275},
  file    = {:Shannon1950.pdf:PDF},
}

@Book{Russell2010,
  author    = {Russell, Stuart and Norvig, Peter},
  title     = {Artificial Intelligence: A Modern Approach, 3rd Edition},
  year      = {2010},
  publisher = {Pearson},
  file      = {:Russell2010.pdf:PDF},
}

@InProceedings{Qi2018,
  author    = {Y. {Qi} and J. {Wang} and Q. {Zhu} and W. {Xu} and X. {Wu}},
  title     = {Double parameter evaluation function based on path},
  booktitle = {2018 Chinese Control And Decision Conference (CCDC)},
  year      = {2018},
  pages     = {236-239},
  file      = {:Qi2018.pdf:PDF},
  keywords  = {evaluation function},
}

@Thesis{Paulsen2009,
  author      = {Paulsen, Philip},
  title       = {Lernen unterschiedlich starker Bewertungsfunktionen aus Schach-Spielprotokollen},
  institution = {TU Darmstadt},
  year        = {2009},
  date        = {2009-07-08},
  url         = {http://www.ke.tu-darmstadt.de/lehre/arbeiten/diplom/2009/Paulsen_Philip.pdf},
  urldate     = {2019-11-07},
  file        = {:Paulsen2009.pdf:PDF},
  keywords    = {evaluation function, alpha beta pruning},
}

@Online{Shah2007,
  author   = {Rajiv Bakulesh Shah},
  title    = {minimax, In Dictionary of Algorithms and Data Structures},
  year     = {2007},
  url      = {https://xlinux.nist.gov/dads/HTML/minimax.html},
  urldate  = {2019-12-20},
  file     = {:Shah2007.pdf:PDF},
  keywords = {minimax},
}

@Article{Elnaggar2014,
  author  = {Elnaggar, Ahmed and Gadallah, Mahmoud and Mostafa, Mostafa and Eldeeb, Hesham},
  title   = {Figure 1. A Comparative Study of Game Tree Searching Methods},
  journal = {International Journal of Advanced Computer Science and Applications},
  year    = {2014},
  volume  = {5},
  pages   = {68-77},
  url     = {https://www.researchgate.net/figure/Game-tree-for-Tic-Tac-Toe-game-using-MiniMax-algorithm_fig1_262672371},
  urldate = {2019-12-20},
  file    = {:Elnaggar.pdf:PDF},
}

@Online{Wiki2019,
  author   = {Chess Programming Wiki},
  title    = {Move Ordering},
  year     = {2019},
  url      = {https://www.chessprogramming.org/Move_Ordering},
  urldate  = {2020-01-21},
  file     = {:Wiki2019.pdf:PDF},
  keywords = {presorting},
}

@Online{Wiki2019a,
  author   = {Chess Programming Wiki},
  title    = {Iterative Deepening},
  year     = {2019},
  url      = {https://www.chessprogramming.org/Iterative_Deepening},
  urldate  = {2020-01-21},
  file     = {:Wiki2019a.pdf:PDF},
  keywords = {iterative deepening},
}

@Online{Wiki2019b,
  author   = {Chess Programming Wiki},
  title    = {Depth-First},
  year     = {2019},
  url      = {https://www.chessprogramming.org/Depth-First},
  urldate  = {2020-01-21},
  file     = {:Wiki2019b.pdf:PDF},
  keywords = {depth-first},
}

@Article{Korf1985,
  author   = {Richard E. Korf},
  title    = {Depth-first Iterative-Deepening: An Optimal Admissible Tree Search},
  journal  = {Artificial Intelligence},
  year     = {1985},
  volume   = {27},
  pages    = {97--109},
  file     = {:Korf1985.pdf:PDF},
  keywords = {iterative deepening, pre-sorting},
}

@Online{Stuckardt,
  author   = {Stuckardt, Roland},
  title    = {Ruhesuche (Quiescence Search)},
  url      = {http://www.stuckardt.de/index.php/schachengine-fischerle/suchtechniken-im-detail/72-ruhesuche-quiescence-search.html},
  urldate  = {2020-01-21},
  file     = {:Stuckardt.pdf:PDF},
  keywords = {quiescence search},
}

@Misc{Wikipedia2018,
  author  = {Wikipedia},
  title   = {50-Züge-Regel --- Wikipedia{,} Die freie Enzyklopädie},
  year    = {2018},
  url     = {https://de.wikipedia.org/w/index.php?title=50-Z%C3%BCge-Regel&oldid=183817296},
  urldate = {2020-02-01},
}

@Misc{Wikipedia2020,
  author  = {Wikipedia},
  title   = {Minimax-Algorithmus --- Wikipedia{,} Die freie Enzyklopädie},
  year    = {2020},
  url     = {https://de.wikipedia.org/w/index.php?title=Minimax-Algorithmus&oldid=195739275},
  urldate = {2020-02-01},
}

@Misc{Wikipedia2020a,
  author  = {{Wikipedia contributors}},
  title   = {Shannon number --- {Wikipedia}{,} The Free Encyclopedia},
  year    = {2020},
  url     = {https://en.wikipedia.org/w/index.php?title=Shannon_number&oldid=939493351},
  urldate = {2020-02-01},
}

@Misc{Wikipedia2019,
  author  = {Wikipedia},
  title   = {Alpha-Beta-Suche --- Wikipedia{,} Die freie Enzyklopädie},
  year    = {2019},
  url     = {https://de.wikipedia.org/w/index.php?title=Alpha-Beta-Suche&oldid=191701260},
  urldate = {2020-02-01},
}

@Online{Wiki2020,
  author   = {Chess Programming Wiki},
  title    = {Transposition Table},
  year     = {2020},
  url      = {https://www.chessprogramming.org/Transposition_Table},
  urldate  = {2020-03-01},
  file     = {:Wiki2020.pdf:PDF},
  keywords = {transposition tables},
}

@Online{Edwards,
  author   = {Steven J. Edwards},
  title    = {Standard: Portable Game Notation Specification and Implementation Guide},
  url      = {http://www.saremba.de/chessgml/standards/pgn/pgn-complete.htm#c16.1},
  urldate  = {2020-04-21},
  file     = {:Edwards.pdf:PDF},
  keywords = {transpositional tables},
}

@Online{Gifhorn,
  author   = {Schachverein~Gifhorn},
  title    = {Wie das Schachspiel erfunden wurde},
  url      = {https://schachverein-gifhorn.jimdofree.com/vereinsinfos/schach-geschichte/},
  urldate  = {2020-04-09},
  keywords = {introduction, history},
}

@Online{Kreuzberg,
  author  = {Schach-Club~Kreuzberg},
  title   = {Schach: Immer noch beliebt},
  url     = {http://sparkassen-jugend-open.de/schach-immer-noch-beliebt/},
  urldate = {2020-04-09},
}

@Comment{jabref-meta: databaseType:biblatex;}

@Comment{jabref-meta: fileDirectory:/home/florian/workspace/python/chess-ai-paper/paper/pdfs;}

@Comment{jabref-meta: fileDirectory-florian-arcanum:/home/florian/workspace/python/chess-ai-paper/paper/pdfs;}

repository: DahlitzFlorian/chess-ai-paper

repo_name: DahlitzFlorian/chess-ai-paper

gha_language: TeX


text:
SUMMARY = "Extensions to the standard Python datetime module"
DESCRIPTION = "The dateutil module provides powerful extensions to the datetime module available in the Python standard library."
SECTION = "devel/python"
LICENSE = "BSD"
LIC_FILES_CHKSUM = "file://LICENSE;md5=51430b33c900f45f999c459ee29ca493"

SRC_URI = "https://pypi.python.org/packages/51/fc/39a3fbde6864942e8bb24c93663734b74e281b984d1b8c4f95d64b0c21f6/python-dateutil-2.6.0.tar.gz"

SRC_URI[md5sum] = "6e38f91e8c94c15a79ce22768dfeca87"
SRC_URI[sha256sum] = "62a2f8df3d66f878373fd0072eacf4ee52194ba302e00082828e0d263b0418d2"

UPSTREAM_CHECK_URI = "https://pypi.python.org/pypi/dateutil/"
UPSTREAM_CHECK_REGEX = "/dateutil/(?P<pver>(\d+[\.\-_]*)+)"

S = "${WORKDIR}/python-dateutil-${PV}"

inherit setuptools3

license: MIT

repository: qtec/meta-qtec-core

license_type: permissive

repo_name: qtec/meta-qtec-core

branch_name: refs/heads/master

extension: bb