Theory of Computer Games (Fall 2020) Homework 1 - Result

Theory of Computer Games (Fall 2020) Homework 1 - Result

Maria Elsa

NTU CSIE

November 19, 2020

Grading Policy

Outline

1 Grading Policy

2 Results

Grading Policy: Overall

The homework is composed of 3 parts. Suppose you get S_i points in part i and receive P penalties, your raw score S0 is defined as

S₀ := max {S₁+ S₂+ S₃− P, 0}

Suppose you submit your homework D days late, your score S is given by

S := LS0, where L := [[D ≤ 7]](0.9)^dDe

Grading Policy

Grading Policy: Part I

Suppose your Sokoboru solver solves n testcases in puzzle file F correctly within 1 minute.

σ(F ) :=

n

X

i =1

s + s

100b100K0

K c

where K0 denotes the optimal penalty, K denotes your penalty to solve puzzle i , and s = 0.05, 0.1, 0.1, 0.15 for tiny, small, medium, and large respectively.

Grading Policy: Part II

You get

S2:= [[your input puzzle passes verifier]]

+[[your input and output puzzle pass verifier]]

points in this part

Grading Policy

Grading Policy: Part III

To get full score, your report should contain how to compile/run

your algorithm

your experiment (includingexecution time)

complexity analysis of Sokoboru, your algorithm and your puzzle

Grading Policy: Penalty

You’ll get some penalties if you don’t follow hw1 spec.pdf Your solver doesn’t read from stdin (-0.5)

Your output file format is invalid (-0.5)

If your directory hierarchy is wrong, you won’t receive any penalty in this homework.

Results

Outline

1 Grading Policy

2 Results

Languages

C++11 89%

C++17

11%

Results

Score Distribution

4 6 8 10 12 14 16 18 0

2 4 6

Part I Execution Times

0 10 20 30

tiny

small

medium

large

2

9

10

20 8

16

14

6 18

3

4

2

# of solvers

Results

Part I Solution Optimality

5 10 15 20 25

tiny

small

medium

large

3

7

11

5

23

12

7

3

# of solvers

Part II Score Distribution

1 2

10 20

Results

Part III Score Distribution

0 1 2 3 4 5

0 10 20