TCG 2018 HW. 1 Result

(1)

TCG 2018 HW. 1 Result

Yunghsien Chung

November 7, 2018

(2)

. . . . . .

. . . . . . . .

. . .

. .

. . . . .

Grading Policy: Overall

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

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

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

S := LS₀,

where L :=JD ≤ 7K(0.9^⌈D⌉) denotes the lateness coefficient.

(3)

Grading Policy: Part I

Suppose your Sokoban solver solves a puzzle file F correctly within 1 minute. Let

νi denote the optimal number of moves of a solution to puzzle i, and nidenote the number of moves of your solution to puzzle i.

Then the basic score is defined as σ1(F) := 1 + 1

1000

∑10 i=1

⌊100ν_i n_i ⌋

Suppose it takes t₁ and t₂ seconds for your solver to solve large.in and large2.in respectively. Then the time bonus is given by

τ₁ :=Jt1≤ 1K + Jt2 ≤ 1K.

You get

S := min{∑

σ (F) + τ , 8}

(4)

. . . . . .

. . . . . . . .

. . .

. .

. . . . .

Grading Policy: Part II

You get

S₂ := 2Jyour puzzle passes verifierK +Jyour puzzle is considered complexK points in this part.

(5)

Grading Policy: Part III

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

your algorithm, your experiment, and

complexity analysis of both Sokoban and your algorithms.

(6)

. . . . . .

. . . . . . . .

. . .

. .

. . . . .

Grading Policy: Penalty

You’ll receive some penalties if you don’t follow hw1_spec.pdf.

Your solver doesn’t read from stdin.

Your solver doesn’t read until the EOF.

The EOL of your puzzle is “\r\n” instead of “\n”.

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

(7)

Languages

C++11

55.5%

33.3%

C++17 3.7% C11

3.7%3.7% Python3

(8)

. . . . . .

. . . . . . . .

. . .

. .

. . . . .

Score Distribution

4 6 8 10 12 14 16 18

0 1 2 3 4

Min: 4.8, Max: 16, Avg: 12.26, Median: 12.97, Stdev: 3.00

(9)

Part I Execution Times

0 5 10 15 20 25 30

small

small2

large

large2

2

4

8

18 7

5

17

8 18

18

2

1

Number of Solvers

(10)

. . . . . .

. . . . . . . .

. . .

. .

. . . . .

Part I Solution Optimality

0 5 10 15 20 25

small

small2

large

large2

10

7

6

6 15

16

13

3

Number of Solvers optimal non-optimal