Puzzles/POY 2010

From J Wiki
Jump to navigation Jump to search

Puzzle of the year 2010: find phrases that generate each number i.100 , making no use of

  • digits other than 2 0 1 0 in sequence
  •  _ and __ and _. as numbers
  • letters in numeric constants (e.g. 20r10 for 2 is prohibited)
  • literal strings
  • ?. or ?

The number of words in each phrase is to be minimized. (Word count is according to #;:y ). Where there are multiple phrases for the same number with the same number of words, phrases with fewer essential characters are preferred, and if those are equal, then phrases whose values can be worked out by hand are preferred.

Solutions: 

 0  /: 2010
 1  * 2010
 2  2: 010
 3  >. 2.010
 4  # 2 0 1 0
 5  p: 2: 010
 6  #. _2 010
 7  <. ^. 2010
 8  >. ^. 2010
 9  <: {: 20 10
10  {: 20 10
11  # #: 2010
12  +: #. _2 010
13  <: #. 2 010
14  #. 2 010
15  >: #. 2 010
16  *: # 2 0 1 0
17  <: #. 2 0 10
18  #. 2 0 10
19  <: {. 20 10
20  {. 20 10
21  >: {. 20 10
22  #. |. 20 1.0
23  #. ! 2 0 1 0
24  ! # 2 0 1 0
25  -: #. 20 10
26  >. %: o. 201.0
27  #. <: 20 _10
28  +: #. 2 010
29  <: #. 20 _10
30  #. 20 _10
31  p: {: 20 10
32  2^-:010
33  #. >: 2 0 1 0
34  #. *: 2 0 1 0
35  <: +: #. 2 0 10
36  +: #. 2 0 10
37  p: # #: 2010
38  #. <: 20 1.0
39  #. >: /: 2 0 1 0
40  +:{.20 10
41  #. 20 1.0
42  >: #. 20 1.0
43  <: <. %: 2010
44  <. %: 2010
45  2 ! 010
46  */ >: 2 !0 10
47  p: #. 2 010
48  >: p: #. 2 010
49  <: #. 20 10
50  #. 20 10
51  >: #. 20 10
52  *./ <. 2^>:^0 1 0
53  #. >: 20 10
54
55  #. p: 2 0 10
56  #. p: 2 0 1 0
57  >.*/,^^ > p. 2 0 1 0
58
59  p: *: # 2 0 1 0
60  +: #. 20 _10
61
62  #. 20 + 1 0
63  <. o. 20.10
64  >. o. 20.10
65
66
67  {: q: 2010
68
69
70
71  #. <: 20 _1 0
72
73  p: {. 20 10
74
75  #. <: 20 1 0
76  #. >: q: 201.0
77  <: #. 20 _1 0
78  #. 20 _1 0
79  >: #. 20 _1 0
80  20 * >. %: 10
81  <: #. 20 1 0
82  #. 20 1 0
83  >: #. 20 1 0
84
85  #. >: 20 _1 0
86
87
88
89  #. >: 20 1 0
90  +: 2!010
91
92  #. >: >: 20 _1 0
93
94  +: #. <: 20 10
95  >. #. o. 20 _10
96  #. >: >: 20 1 0
97  p: ! # 2 0 1 0
98  +: <: #. 20 10
99  <: #. +: 20 10


See also

Comments

  • This is getting boring imo. I only really worked on this in a single year. I admit I haven't yet written an automated solution that searches most of the solution space for solutions, but that would be just as interesting for an older year than for this one. I propose that there be no new years of this puzzle posted, instead either we keep optimizing one of the older years (choose one with the best solutions currently and mark the rest as depreciated) and/or someone invent a significantly different puzzle for 2010. -- B Jonas <<DateTime(2009-09-27T11:56:53+0200)>>
  • No one is forced to participate. -- Roger Hui <<DateTime(2009-09-27T06:27:03-0800)>>
  • I finally found a proof that even the hardest of these can be solved in 5 words. 91 is # ; = ` Z2OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO008B . Of course, that's unlikely to ever be the shortest solution, as in some of the past years we've found solutions of at most 4 words for most entries, and 5 word long solutions with fewer characters for the other few. -- B Jonas <<DateTime(2010-08-09T00:28:18+0200)>>
Retrieved from "https://code.jsoftware.com/mediawiki/index.php?title=Puzzles/POY_2010&oldid=41538"