Playing by hand, I use a strategy similar to the Corner Strategy and
reaches 2048 about half the time (seems like more). My highest score ever
is over 60,000.
The strategy is this: keep the largest number in a corner (and minimize
its movement).
On Mon, Jul 4, 2016 at 2:35 PM, Brian Schott wr
Ric,
Yes, I am using the latest version.
Your corner is better.
Perhaps my expectations for game length were over optimistic.
Thanks, again,
corner=: monad define
while. _1 ~: 18!:0 grd do.
Start=. Grid__grd
right__grd ''
down__grd ''
if. Grid__grd -: Start do. NB. see if right/down didn't do a
Hi Brian,
Are you using the latest version of 2048? Raul identified incorrect
behaviour in the initial version I released which was corrected in version
1.0.1
load 'pacman'
'search' jpkg '2048'
┌──┬─┬─┬─┐
│games/2048│1.0.1│1.0.1│2048 game│
└──┴─┴─┴──
^/__ q:4200
8 3 25 7
On Mon, Jul 4, 2016 at 3:48 PM, Ric Sherlock wrote:
> How's this?
>*//.~ q: 4200
> 8 3 25 7
>
> On Tue, Jul 5, 2016 at 9:46 AM, Kip Murray wrote:
>
> > Consider
> >
> > q: 4200
> > 2 2 2 3 5 5 7
> >
> > How would you "reduce" this to 8 3 25 7 ?
> > Write the
How's this?
*//.~ q: 4200
8 3 25 7
On Tue, Jul 5, 2016 at 9:46 AM, Kip Murray wrote:
> Consider
>
> q: 4200
> 2 2 2 3 5 5 7
>
> How would you "reduce" this to 8 3 25 7 ?
> Write the verb red:
>
> red q: 4200
> 8 3 25 7
>
> --Kip Murray
>
>
>
> --
> Sent from Gmail Mobile
> ---
Consider
q: 4200
2 2 2 3 5 5 7
How would you "reduce" this to 8 3 25 7 ?
Write the verb red:
red q: 4200
8 3 25 7
--Kip Murray
--
Sent from Gmail Mobile
--
For information about J forums see http://www.jsoftware
I have been spending a little more time than I would like to admit with
2048 since you released it. And just this weekend I discovered the
following link which mentions a rather simple strategy for doing well at
2048, referred to as "The Corner Strategy" therein. If you don't want to
read the artic
It seems to me that the unicode characters will be difficult to display on
a window that assumes fixed width characters. When J is displayed in a
browser the boxing could be done using browser tools which can handle
unicode in boxes just fine. Perhaps there are some tools in Qt to handle
boxing als
Looks cool,
FYI, a page that lists double wide unicode characters,
http://www.cl.cam.ac.uk/~mgk25/ucs/wcwidth.c
the table at https://en.wikipedia.org/wiki/UTF-8
provides a systematic way of counting characters,but converting to unicode and
counting is probably faster.
- Original Mess
I was looking at
http://math.stackexchange.com/questions/1294800/average-distance-between-two-randomly-chosen-points-in-unit-square-without-calc
and I was wondering how one might perform this calculation in J.
It is, of course, fairly straightforward to approximate:
(+/ %#)+/&.:*:@:(-/)?2 2 1e
I am also a big fan of dot product (.); however, I have noticed that when
the following assertion holds:
assert (X u/ .v Y) -: (X u/@:v Y)
often the form u/@:v reportedly requires less space. For example,
stp=. ([ ((<;._1 '|Sentence|Space|Time|Space * Time') , (, */&.:>@:(1
2&{))@:(] ; 7!:2@
neat,
byunique =: ("_1) (@:[) ((i.`{)`)(`:6)(~.`)(`])(`:6)
is it just habit to do 'byunique' f.
It doesn't seem to change anything.
- Original Message -
From: Jose Mario Quintana
To: Programming forum
Sent: Monday, July 4, 2016 3:16 PM
Subject: Re: [Jprogramming] Adverbial Tacit Jy
I have developed my enhanced view of shapes and types in J a bit further to
include unicode and utf8.
Video of the viewer is available here https://youtu.be/eN9H-rMk1No and feedback
is welcomed.
Cheers, bob
> On Jun 17, 2016, at 8:54 PM, robert therriault wrote:
>
> Thanks Bill,
>
> If the
A solution to Exercise 6 is shown below; but, since the challenge was
posed a long time ago, the exercise is shown first as a reminder
(explicit solutions are allowed but tacit solutions, particularly
fixed tacit solutions, are preferred).
Exercise 6. Let us assume that u is an arbitrary monadic
14 matches
Mail list logo
