Papers with Code 아카이브
Game of Chess
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
Chess is a two-player strategy board game played on a chessboard, a checkered gameboard with 64 squares arranged in an 8×8 grid. The idea of making a machine that could beat a Grandmaster human player was a fascination in the artificial community for decades. Famously IBM's DeepBlue beat Kasparov in the 1990s. More recently more human-like approaches such as AlphaZero have appeared.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Diversifying AI: Towards Creative Chess with AlphaZero
The Value of Chess Squares
Representation Matters for Mastering Chess: Improved Feature Representation in AlphaZero Outperforms Switching to Transformers
Human and Machine Intelligence in n-Person Games with Partial Knowledge: Theory and Computation
Hybrid cuckoo search algorithm for the minimum dominating set problem
Acquisition of Chess Knowledge in AlphaZero
Modeling the Mistakes of Boundedly Rational Agents Within a Bayesian Theory of Mind
Chess as a Testbed for Language Model State Tracking
Playing Chess with Limited Look Ahead
Leveraging Rationales to Improve Human Task Performance
Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model
Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm
DeepChess: End-to-End Deep Neural Network for Automatic Learning in Chess
A Popperian Falsification of Artificial Intelligence -- Lighthill Defended
Phoenix: A Self-Optimizing Chess Engine
Giraffe: Using Deep Reinforcement Learning to Play Chess
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.