Pimp Your GradCap Party!

Posted Tue, 05/05/2009 - 4:28pm by acm

"Bling Out Your Graduation Caps"
May 7th at 5:00pm, Engineering Building @ Room 105 (ACM Lounge)

Some of us are about to graduate, and to look cool during graduation we are throwing an EE/CS "Bling Out Your Graduation Caps" party, on May 7th at 5PM in the room 105. I'll bring a bunch of LED's, and various electronic components. I'll also get some food delivered. Even if you are not graduating, stop by and have some fun making circuits and soldering some stuff.

You might want to bring:
- Your graduation cap (duh)!
- 9V batteries, I got a bunch of 9V battery clips so you might want to bring 9V batteries for your circuit.
- Soldering Iron, we have some but to make it so you don't have to share you might want to bring one. (You can buy a pocket butane soldering iron @ Radio Shack for cheap!)

EVEN IF YOU'RE NOT GRADUATING, COME HANG OUT AND DO GEEKY STUFF WITH US!

Example 2008 Gradcap Pimped!

Posted Tue, 05/05/2009 - 4:28pm by acm

ICFP 2009!

Posted Sun, 04/19/2009 - 2:26am by acm

The ICFP Programming Contest is a highly caffeinated codefest where a bunch of geeks gather in the ACM room and solve problems together all weekend long! There aren't strong requirements like the ICPC (where you must not have been going to school longer than 4 years, you must be 25 or under, etc.) SO ANYONE CAN JOIN IN!

Here's the 2009 Website (won't be up until closer to the date)!

The ACM Montage Video 2009

Posted Fri, 04/17/2009 - 1:23pm by Leah Shanker

ACM Officer Nominations & Campaigns THIS THURSDAY

Posted Mon, 04/13/2009 - 4:20pm by Leah Shanker
  • ACM Movie: Memories featuring our immediate Graduates
  • Reading the ACM Constitution & Officer Expectations
  • Next Semester's Restructured Committee Groups
  • Nominations & Campaign Questions Answered
  • Pizza, Games and General Mayhem

Since the Nominations & Campaigns historically take so long, we're not going to have a demo/lecture this time.

Meeting will be held this Thursday, April 16 at 6PM in Room 105!

What is missing (most) from LOUIE?

Posted Sun, 04/05/2009 - 8:11pm by Leah Shanker
Nothing, LOUIE's actually pretty great!
0% (0 votes)
A discussion forum: See what everyone says from previous semesters.
11% (2 votes)
Speed: LOUIE is way too slow for my taste.
28% (5 votes)
A Roster! I want to see who else is taking the class.
6% (1 vote)
Usability: How the heck do I ... ?
39% (7 votes)
Other (Please leave comment)
17% (3 votes)
Total votes: 18

How Do I Add My Completed Game to the Cabinet?

Posted Sat, 04/04/2009 - 11:51pm by Leah Shanker

Congratulations, you've completed your game! After working on it so hard, you'll likely want to make sure it's playable on the Game Cabinet for the rest of eternity! You'll be happy to hear that it's actually pretty simple to get your game ready for Cabinet-release. First things first, make sure you meet the game requirements:

  • The game to be added to the Game Cabinet is a complete, polished, playable game.
  • All game-related media (music, artwork, movies) is original, public domain or otherwise licensed.

The NAU ACM Game Cabinet

Posted Sat, 04/04/2009 - 7:08pm by Leah Shanker

The NAU ACM Game Cabinet is an entirely original creation conceived and built here at the ACM to showcase playable student-created games and actively promote enthusiasm for computing and technology. The goal was to create a permanent fixture of NAU Student Life and encourage conversation centered around quality student projects.

Inspiration:

Next Digital Carnival Game?

Posted Sun, 03/22/2009 - 6:13pm by Jordan Hedges
Soul Calibur IV
53% (10 votes)
Street Fighter IV
26% (5 votes)
Super Smash Bros. Brawl
21% (4 votes)
Total votes: 19

Insomnia Online Programming Competition

Posted Mon, 03/16/2009 - 4:33am by acm

So what are you doing over Spring Break? That's right, CODE PARTYING!

The Grand Prize is 30,000 rupees...which translates to ~$584 but it sounds WAY COOLER to win 30,000 of something!

We will be coding in Room 105! Comment on the forums if you need a partner still (TEAMS OF ONE OR TWO)!

Just glancing at the problems they're requiring, they seem like they were ripped *straight from the ICPC* and they should be really easy! We've all seen the 3n+1 problem before!

Syndicate content