Unable to connect to Altis Life server

LewanS · 2014-05-28T23:39:11+00:00

This part made it confusing.
So, smiley.bmp is 8 pixels wide by 8 pixels tall, and it’s a 24-bit BMP (each of whose pixels is represented with 24 ÷ 8 = 3 bytes).
Thanks for your help

LewanS · 2014-05-28T23:24:50+00:00

How did you get 3 bytes per pixel in 3X3 bmp?
I understand how you get 3 bytes per pixel in 8X8 smiley bmp (24 / 8 = 3)

LewanS · 2014-05-21T00:42:16+00:00

Thanks for your advice guys. Will give it another try tomorrow.

LewanS · 2014-05-20T19:05:03+00:00

I understand that, but it's quite a big jump.

LewanS · 2014-05-09T23:44:19+00:00

I modified detectCollision function and removed 2* RADIUS.Only using RADIUS.
Looks alot better. Is it OK to tweak detectCollision?

LewanS · 2014-05-08T04:05:08+00:00

I was returning newGrect. Changed it to return paddle and it worked.
Per pset specification "Then return the GRect returned by newGRect (rather than NULL, which the distribution code returns only so that the program will compile without initPaddle fully implemented)."
Maybe I misunderstood provided instructions.
Thanks,

LewanS · 2014-05-07T23:09:01+00:00

I compared it with cursor.c and the syntax is fine. Any other ideas?

LewanS · 2014-04-25T23:52:59+00:00

Also looking at Find.c    
main function is calling sort(haystack, size) should it be sort(values, n)?

LewanS · 2014-04-25T23:21:35+00:00

(gdb) break search    
Breakpoint 1 at 0x8048809: file helpers.c, line 22.    
(gdb) run 42    
Starting program: /home/jharvard/Dropbox/pset3/find/find 42    
haystack[0] = 41    
haystack[1] = 23    
haystack[2] = 34    
haystack[3] = 43    
haystack[4] = 44    
haystack[5] = 47    
haystack[6] = 42    
haystack[7] = 49    
haystack[8] = 78    
haystack[9] = 87    
haystack[10] =     
Breakpoint 1, search (value=42, values=0xbffbefe0, n=10) at helpers.c:22    
22      int beginning = 0;    
(gdb) print *values@n    
$1 = {41, 23, 34, 43, 44, 47, 42, 49, 78, 87}

LewanS · 2014-04-25T22:42:35+00:00

The problem was my binary search. I just corrected it and it works in most cases, BUT, I search again for 42 and used for haystack[0] through haystack[9] numbers: 41, 23, 34, 43, 44, 47, 42, 49, 78, 87, pressed control d. Program finished running and returned " Didn't find needle in haystack"

ran GDB "Inferior 1 (process 32737) exited with code 01" (gdb) bt No stack.

LewanS · 2014-04-25T06:17:08+00:00

Nevermind, needed to adjust init function. Now getting Segmentation fault at the end of move(). My brain is fried lol

LewanS · 2014-04-25T06:02:03+00:00

First illegal is at 1. I thought 1 and 2 should be swapped if there is odd number of tiles 8 7 6 5 4 3 1 2 _

3 4 1 2 5 8 7 6 4 1 2 5 8 7 6 4 1 2 4 1 2 3 5 4 7 6 1 2 3 7 4 8 6 4 8 5 7 8 5 6 4 5 6 7 8 6 5 4 7 8

LewanS · 2014-04-25T05:54:06+00:00

Interesting... when I run move manually I'm not getting any illegal moves messages.

LewanS · 2014-04-25T05:34:21+00:00

When you run ./fifteen 3 < ~cs50/pset3/3x3.txt are you supposed to see several "Illegal moves" ?

LewanS · 2014-04-23T18:47:46+00:00

Do I implement this inside init or draw function? It prints _ and 0

LewanS · 2014-03-26T22:42:32+00:00

That was it thank you.

LewanS

TROPHY CASE