eopXD

CRTP

CRTP 全名 Curiously Recurring Template Pattern ，又被稱作 F-bound polymorphism ，F-bound quantification 中的一種形式。故事要先從型態轉型開始。

入伍

當時沒什麼緊張感，畢竟是必經的一個階段，恰巧被我擺放在延畢後的春天。現在想起來挺幸運的，之後好像要排很久才能服義務役。

Truly Type Safe

今天受 poyenc 開示關於物件的抽象化以至於真正的 type safe ，撰文以誌之。

Canonical Coin System

什麼時候一個錢幣系統可以透過 Greedy 得到 Optimal 呢？這個問題從中午買低 GI 便當開始⋯⋯

Morris Traversal

介紹一下 Morris traversal ，一個 O(1) 空間複雜度的樹遍歷演算法。
故事是從二元樹開始。一般對二元樹的子樹刪除，最樸素的作法是這樣寫⋯⋯

2019 秋電腦對局理論助教

這是個在台大電腦對局理論擔任助教的個人紀錄。除了要向世界表達我擔任助教的開心與成就感之外，大概就是想鼓勵其他人如果有機會當助教的話千萬不要錯過了。
要感謝徐讚昇老師願意給我這次機會當助教，還允許我在同時間修撞課的編譯器設計。也謝謝宗佑不修課還願意旁聽並聽我上台解釋作業耍猴戲。

This is variation of Einstein Würfelt Nicht which rules are modified for bigger branching factor and longer game length. Both player starts with 6 game pieces each. The goal is to move the smallest piece possible towards the diagonal of your opponent. This is a 2-agent game to challenge AI agent to do decent pruning and also good evaluation of current board for their Monte Carlo Search. You are also welcome to solve the game with Alpha-Beta Search.

Checkout my repository for the game: 2 agent game – Einstein Würfelt Nicht Agent

Pukoban Solver

Sokoban（推箱子） is a classic single agent game. It has a sufficient of game state and is a classic problem in the field of game AI.
Pokoban is a variation of the game, adding “Pull” to the game. You can pull a box when there is an empty space behind you and a box in front. This additional action gives the game even wider branching factor, making the search harder.
Here is the game interface that you can actually play the game:

Checkout my repository for the game: Single agent game – Pukoban

Author: eopXD

Matilda (1996)