Birth By Sleep Tools

Waiting Final Mix release, I'm preparing some tools compatible with Windows that unpack or repack textures and archive files that contains 3D models or a lot of other interesting stuff:

BBST_TIM:
This tool will extract all TIM files on BBSX.DAT (replace X with 0, 1, 2 or 3). It will create also an LIST file that contain the original position of TIM files if you want to edit textures and put them back to BBSX.DAT archives.
BBST_ARC:
This is similar to BBST_TIM but this will extract ARC files, archives that contains a lot of data (textures, 3D models or other infos). This also create the LIST file.
BBST_Patch:
This tool is require if you want to put back the TIM and ARC files. Simply use the command line or batch files to  use this (BBST_Patch <bbsx.dat> <list file>).
BBST_UNARC:
Unpack the ARC files and create an ARCLIST for recreate an ARC archive.
BBST_PKARC:
Create a new ARC file (the old ARC isn't require like BBSX.DAT with BBST_Patch) and repack the files extracted from BBST_UNARC using the ARCLIST. If you want to increase the size of the ARC be careful!!! For example lets take out_0A6DD800.arc from the US/EU BBS0.DAT and take the size: 331.288 byte. Now divide this for 2048 obtaining 161,76171875. Remove the numbers after the comma and multiplies 161 per 2048 (we'll get 329728) and subtrac the original size with the last result (331288 - 329728): we'll obtain 1560. This means that the ARC file size can increase of 1560 reaching an maximum size of  332848 bytes. This limit (but useful) born from the decryption format that Birth By Sleep use and from the undiscovered LBA that the various BBSXs use.

You can create also some scripts like "Terra to Terranort" using Batch language to obtain results like this:

We Rule Quests - Convenienza piante

Ultimamente stò giocando ad un gioco simpatico su iPod Touch chiamato We Rule Quests. E' un gioco che ricorda subito Farmville con tanto di piantagioni ecc. Volevo scrivere qui nel blog perchè stasera ho fatto un piccolo esperimento che mi è costato 10 min o poco meno, ovvero scrivere dettagliatamente se conviene o no piantare determinati tipi di semi. Per fare ciò mi sono servito di una semplice formula, ovvero guadagno/tempo e ho reso le cose più facili con un semplice programmino scritto in C:

#include <stdio.h>

int Read(char *text)
{
int value;
printf(text);
scanf("%i", &value);
return value;
}

int main()
{
printf("We Rule Quests - Calcolatore convenienza\n\n");

REDO:
int costo = Read("Inserire costo piantagione: ");
int guadagno = Read("Inserire guadagno vendita: ");
int exp = Read("Inserire guadagno exp: ");
int tempo = Read("Inserire il tempo di maturazione (in minuti): ");

printf("\nConvenienza gold: %.4f", (float)(guadagno-costo)/tempo);
printf("\nConvenienza exp : %.4f", (float)exp/tempo);

printf("\n\n");
goto REDO;
}

Accompagnato dai risultati dell'esperimento da me fatto (valori più alti indicano maggiore convenienza):