/prog/ - ICFP 2014 — Tinychan BBS

Name: Anonymous 2014-07-25 14:42

The spec is out.
http://icfpcontest.org/specification.html

Who else is participating? Will you write your own implementations without submitting it just for fun?

Name: Anonymous 2014-07-25 16:23

Previous first prize winners have used Haskell, OCaml, C++, Cilk, Java and F#.

Name: Anonymous 2014-07-25 21:12

Why no lisp ot C?

Name: Anonymous 2014-07-26 3:44

LamCo were building an arcade game where you control a little character called “Lambda-Man” who runs around in a maze eating pills and evading ghosts.

That's cute.

Name: Anonymous 2014-07-26 10:02

>>3
Because they're shit.

Name: Anonymous 2014-07-26 15:33

>>5
Just because you're too dumb to understand pointers, it doesn't mean C is garbage.

Name: Anonymous 2014-07-26 17:55

>>6
What's the equivalent of C pointers in lisp? As in what is perceived as the hardest feature of lisp.

Name: Anonymous 2014-07-26 18:02

>>6
Using pointers is the programming equivalent of toilet scrubbing.

Name: Anonymous 2014-07-26 22:14

ICFP should really stand for "I Can't Fucking Program", the feeling you get when you try to write something in these contests.

Name: Anonymous 2014-07-26 22:55

>>8
Toilet scrubbing is useful

Name: Anonymous 2014-07-27 2:28

>>1
this looks pretty cool =)

I might look into the cyclic graph representation side, as a sort of map-intelligence? Junctions are nodes, paths are edges?

Name: Anonymous 2014-07-27 4:34

>>10
Nope. It was useless until ways to make it automatic were invented. Nowadays even Haskell is often faster than C.

Name: Anonymous 2014-07-27 4:36

>>12
*It was useful

Name: Anonymous 2014-07-27 7:29

>>9
It does say you can use any language you like, just need to build a simulator =)

Name: Anonymous 2014-07-27 14:56

>>12

No. Do you enjoy sitting on shat up toilets? I don't.

Name: Anonymous 2014-07-27 15:16

>>15
I enjoy having a high-level toilet-scrubbing robot that (almost) eliminates the possibility of me stepping into shit or urine.

http://ro-che.info/ccc/25

Name: Anonymous 2014-07-27 15:45

>>16
I'm not talking programming you stupid jew.

Name: Anonymous 2014-07-27 16:00

Well I wrote a compiler from Lambda-Man assembly to Common Lisp.

Name: Anonymous 2014-07-27 16:32

>>17
Why aren't you talking programming if C is a programming language? Why are you calling me a Jew?

Name: Anonymous 2014-07-27 18:48

>>16

segfaults
buffer overruns

All those problems are because of the programmer.

Name: Anonymous 2014-07-27 19:09

>>16

click next
get error message

Name: Anonymous 2014-07-27 22:38

>>7
Lisp =)

Is it better to link the junctions with paths, or have the paths linked by junctions?

Name: Anonymous 2014-07-27 22:52

I've got the junctions numbered, but i think i want the paths numbered so i can map from x,y to path Id...
Should make for a nice path-finding alg =)

Name: Anonymous 2014-07-27 23:39

And with the ghosts, they are restricted to only choosing a direction on a junction, and not allowed to turn back the same way?

Name: Anonymous 2014-07-28 1:44

>>7
Macros, Continuations, or the CLOS Meta-object protocol

Name: Anonymous 2014-07-28 3:58

>>21
That is as intended. Did you even read the error message?

Name: Anonymous 2014-07-28 4:23

Sim is working =D i have ghosts roaming the classic map at random in octave...
http://img.techpowerup.org/140728/lambdaman.png

Name: Anonymous 2014-07-28 10:43

Ah, so you just do it like this?

tblNode
 - (Node_id), Path_id, Path_id, Path_id, Path_id, X, Y
tblPath
 - (Path_id), Node_id, Node_id, Dist

Name: Anonymous 2014-07-29 6:05

getting the graph out the map =D
http://img.techpowerup.org/140729/cg.png

ICFP 2014

1 Name: Anonymous 2014-07-25 14:42

2 Name: Anonymous 2014-07-25 16:23

3 Name: Anonymous 2014-07-25 21:12

4 Name: Anonymous 2014-07-26 3:44

5 Name: Anonymous 2014-07-26 10:02

6 Name: Anonymous 2014-07-26 15:33

7 Name: Anonymous 2014-07-26 17:55

8 Name: Anonymous 2014-07-26 18:02

9 Name: Anonymous 2014-07-26 22:14

10 Name: Anonymous 2014-07-26 22:55

11 Name: Anonymous 2014-07-27 2:28

12 Name: Anonymous 2014-07-27 4:34

13 Name: Anonymous 2014-07-27 4:36

14 Name: Anonymous 2014-07-27 7:29

15 Name: Anonymous 2014-07-27 14:56

16 Name: Anonymous 2014-07-27 15:16

17 Name: Anonymous 2014-07-27 15:45

18 Name: Anonymous 2014-07-27 16:00

19 Name: Anonymous 2014-07-27 16:32

20 Name: Anonymous 2014-07-27 18:48

21 Name: Anonymous 2014-07-27 19:09

22 Name: Anonymous 2014-07-27 22:38

23 Name: Anonymous 2014-07-27 22:52

24 Name: Anonymous 2014-07-27 23:39

25 Name: Anonymous 2014-07-28 1:44

26 Name: Anonymous 2014-07-28 3:58

27 Name: Anonymous 2014-07-28 4:23

28 Name: Anonymous 2014-07-28 10:43

29 Name: Anonymous 2014-07-29 6:05